Two normality criteria and counterexamples to the converse of Bloch's principle (Q903965)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two normality criteria and counterexamples to the converse of Bloch's principle |
scientific article |
Statements
Two normality criteria and counterexamples to the converse of Bloch's principle (English)
0 references
15 January 2016
0 references
The authors consider normality criteria and the converse of Bloch's principle for a family of meromorphic functions. A family of functions meromorphic in a domain and possessing a certain property \(\mathcal P\) is likely to be normal if there is no non-constant function meromorphic in the plane which has this property \(\mathcal P\). This heuristic principle is commonly attributed to Bloch, see, e.g. [\textit{W. Bergweiler}, Comput. Methods Funct. Theory 6, No. 1, 77--108 (2006; Zbl 1101.30034)]. Consider the following two statements: {\parindent=6mm \begin{itemize} \item[(a)] If a meromorphic function satisfies a condition \(\mathcal P\) in the complex plane, then it must be a constant function. \item [(b)] If a family of meromorphic functions satisfies the condition \(\mathcal P\) in an arbitrary complex domain, then the family is normal. \end{itemize}} The Bloch principle can be understood as ``(a) implies (b)''. The authors pay attention for the converse of the Bloch principle as ``(b) implies (a)'', see, e.g. [\textit{K. S. Charak} and \textit{J. Rieppo}, J. Math. Anal. Appl. 353, No. 1, 43--48 (2009; Zbl 1168.30018)]. Two results are obtained in this paper. One of them the following. Let \(\mathcal F\) be a family of meromorphic functions on a domain \(D\). Let \(n\geq 2\), \(m\geq k \geq 1\) be positive integers and let \(a\neq 0\) and \(b\) be two finite values. If, for each \(f\in \mathcal F\), \(f^n(z)(f^m)^{(k)}(z)=a \Longleftrightarrow (f^m)^{(k)}(z)=b\), then the family \(\mathcal F\) is normal on \(D\). This is an extension of a result by \textit{M. L. Fang} and \textit{L. Zalcman} [Comput. Methods Funct. Theory 1, No. 1, 289--299 (2001; Zbl 1045.30020)] to a bigger class of differential polynomials. The Nevanlinna theory and Zalcman's rescaling lemma are useful tools for the proof.
0 references
meromorphic functions
0 references
normal families
0 references
differential polynomials
0 references
shared values
0 references
small functions
0 references