Research Problems in Function Theory — Problem 1.33
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.For a nonconstant meromorphic function $f$ on $\mathbb C$, let $n(r,a,f)$ count the solutions of $f(z)=a$ in $|z|\le r$, with multiplicity; $a=\infty$ counts poles. Let $\bar n$ count each point once. The integrated count is \[ N(r,a,f)=n(0,a,f)\log r+\sum_{0<|z|\le r,\ f(z)=a}\log(r/|z|), \] where the sum repeats each point according to multiplicity; $\bar N$ has the same formula without repetitions. Write $\log^+x=\max(\log x,0)$ and \[ m(r,\infty,f)=\frac1{2\pi}\int_0^{2\pi}\log^+|f(re^{it})|\,dt,\quad m(r,a,f)=\frac1{2\pi}\int_0^{2\pi}\log^+\frac1{|f(re^{it})-a|}\,dt\quad(a\in\mathbb C). \] The Nevanlinna characteristic is $T(r,f)=m(r,\infty,f)+N(r,\infty,f)$. Its order and lower order are \[ \rho(f)=\limsup_{r\to\infty}\frac{\log T(r,f)}{\log r},\qquad \lambda(f)=\liminf_{r\to\infty}\frac{\log T(r,f)}{\log r}. \] The deficiency is $\delta(a,f)=1-\limsup_{r\to\infty}N(r,a,f)/T(r,f)$, and the reduced-count index is $\Theta(a,f)=1-\limsup_{r\to\infty}\bar N(r,a,f)/T(r,f)$. A value is deficient if $\delta(a,f)>0$. An entire function is holomorphic on all of $\mathbb C$; for an entire function, $M(r,f)=\max_{|z|=r}|f(z)|$.
Statement recorded in the supplied source.
For a nonconstant finite-order meromorphic function $f$ whose derivative is not identically zero, write \[ N_1(r,f)=N(r,0,f')+2N(r,\infty,f)-N(r,\infty,f'). \] Does $N_1(r,f)=o(T(r,f))$ as $r\to\infty$ imply $2\rho(f)\in\mathbb Z$? The first term is the integrated count of zeros of $f'$, which the source abbreviates as $N(r,1/f')$. [S2]Short English statement
Does a negligible ramification count force the order to be a half-integer? The 2018 source records a complete affirmative resolution. [S2]Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 2301033 (AMR-022-1033). CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Walter K. Hayman and Eleanor F. Lingham, Research Problems in Function Theory, Fiftieth Anniversary Edition (2018), arXiv:1809.07200. Problem 1.33, its full Update 1.33, and chapter notation; original author TeX. https://arxiv.org/abs/1809.07200.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.