Erdős Problem #1116
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (not automatically the live result).
Subject areas: analysis.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
For a function \(f(z)\), count the solutions of \(f(z)=a\) inside a disk of radius \(r\). Different target values \(a\) may be attained very different numbers of times.
Erdős Problem #1116 asks whether there is a single meromorphic, or even entire, function for which the root counts of every two distinct target values fluctuate so drastically that
Here \(n(r,a)\) counts roots of \(f(z)=a\) in \(|z|<r\). The multiplicity convention and treatment of early radii with a zero denominator require primary-source normalization.
A small example
For the ordinary polynomial \(f(z)=z^2\), the equations \(f(z)=1\) and \(f(z)=4\) each have two distinct roots. Once \(r>2\),
A polynomial therefore gives no evidence for the extraordinary simultaneous oscillations Erdős requested. The example fixes how disk root counting works without implying any result about the desired entire-function construction.
What is known
The problem is solved in the affirmative. The maintained Erdős catalogue credits Toppila (1976) and Gol'dberg (1978) with constructing entire functions having the requested simultaneous property.
Because the statement says for every pair of target values, merely showing unusually many zeros for one particular value is insufficient. Entire-function constructions supporting such comprehensive value-distribution irregularity are fundamentally different from a polynomial's eventually constant root counts.
GCL's current state
Authenticated original-issue audit #2387 records the exact quantifier, the published authors' attribution and the elementary \(z^2\) contrast.
The catalogue text was recovered from indexed problem and revision pages after direct retrieval temporarily failed. The 1976 and 1978 primary mathematical papers have not been independently read in full.
What remains
Verify Toppila's and Gol'dberg's original proof statements, exact root-multiplicity convention, and how the ratio is interpreted before denominators become nonzero. Extract a reusable lemma for simultaneously controlling target-value distributions, with proof dependencies and precise hypotheses.
Sources and claim boundaries
Erdős Problem #1116; Hayman (1974), Problem 1.25; Toppila (1976); Gol'dberg (1978); GCL source audit. This is an externally solved problem, not a GCL construction. The polynomial example is independently exact. Unaccepted draft; primary fidelity pending.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2387 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.