Let$S$denote the class of schlicht functions. D. Bertilsson proved recently that for$f∈S, p<0$and$1<-N<-2|p|+1$the modulus of the$N$th Taylor coefficient of ($f′$)^{$p$}takes its maximal value if$f$is the Koebe function. Here a short proof of a generalisation of this result is presented.

In this paper, we study the zero loci of local systems of the form \delta\Pi , where \delta\Pi is the period sheaf of the universal family of CY hypersurfaces in a suitable ambient space \delta\Pi , and \delta\Pi is a given differential operator on the space of sections \delta\Pi . Using earlier results of three of the authors and their collaborators, we give several different descriptions of the zero locus of \delta\Pi . As applications, we prove that the locus is algebraic and in some cases, non-empty. We also give an explicit way to compute the polynomial defining equations of the locus in some cases. This description gives rise to a natural stratification to the zero locus.

In this article we propose a geometric description of Arthur packets for p-adic groups using vanishing cycles of perverse sheaves. Our approach is inspired by the 1992 book by Adams, Barbasch and Vogan on the Langlands classification of admissible representations of real groups and follows the direction indicated by Vogan in his 1993 paper on the Langlands correspondence. Using vanishing cycles, we introduce and study a functor from the category of equivariant perverse sheaves on the moduli space of certain Langlands parameters to local systems on the regular part of the conormal bundle for this variety. In this article we establish the main properties of this functor and show that it plays the role of microlocalization in the work of Adams, Barbasch and Vogan. We use this to define ABV-packets for pure rational forms of p-adic groups and propose a geometric description of the transfer coefficients that appear in Arthur's main local result in the endoscopic classification of representations. This article includes conjectures modelled on Vogan's work, especially the prediction that Arthur packets are ABV-packets for p-adic groups. We gather evidence for these conjectures by verifying them in numerous examples.

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-U, n)$ for $n\geq 5r+18, r+1 \geq k \geq 7,$ $j \geq 6$ where $U$ is a graph on $k$ vertices and $j$ edges which contains a graph $K_3 \bigcup P_3$ but not contains a cycle on $4$ vertices and not contains $Z_4$.

Protein universe is a complex system with critical problem of protein evolution to be analyzed. Early studies have used geometric distances and polygenetic-trees to solve this problem. However, the traditional methods are bivariate, whose taxonomy classification relies on bivariate branching. This is not sufficient to describe the complex nature of protein universe. Therefore, we propose a novel approach on multivariate protein classification. The new method bases on the theory of information and network, can be used to analyze multivariate relationships of proteins. The new method is alignment-free and have wide-applications to both sequences and 3D structures. We demonstrate the new method on six protein examples, results show that the new method is efficient and can potentially be used for future protein classifications.