Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
1 topic

11 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openErdős Problems · Field theory and polynomials

Erdős Problem 1150

Is there some constant c>0c > 0 such that, for all large enough nn and all polynomials PP of degree nn with coefficients in {1,1}\{-1, 1\}, maxz=1P(z)>(1+c)n?\max_{|z|=1} |P(z)| > (1 + c) \sqrt{n}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Complex analysis

Erdős Problem 509

Let f(z)C[z]f(z) ∈ ℂ[z] be a monic non-constant polynomial. Can the set {zC:f(z)1}\{z ∈ ℂ : |f(z)| ≤ 1\} be covered by a set of closed discs the sum of whose radii is 2≤ 2?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Complex analysis

Erdős Problem 513

Let f be a transcendental entire function. What is the greatest possible value of liminf (fun r : ℝ => ratio r f) atTop?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Complex analysis

Erdős Problem 516: Limsup Ratio Eq One Of Has Fejer Gaps

Is it true that for all entire functions f = ∑ aₖzⁿₖ such that ∑' 1 / nₖ < ∞, limsup (fun r => ratio r f) atTop = 1?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Complex analysis

Erdős Problem 517

If f(z) = ∑ aₖzⁿₖ is an entire function (with aₖ ≠ 0 for all k) such that nₖ / k → ∞, is it true that f assumes every value infinitely often?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Complex analysis

Erdős Problem 906

Does there exists an entire non-zero transcendental function f : ℂ → ℂ such that for any sequence n₀ < n₁ < ..., { z | ∃ k, iteratedDeriv (n k) f z = 0 } is dense.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Complex analysis

Bloch and Landau constants

Ahlfors and Grunsky also conjectured in [AG37] that this upper bound is the precise value of the Bloch constant.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Complex analysis

Bloch and Landau constants

In [Ra43], Rademacher says that he strongly believed that this upper bound is the precise value of the Landau constant.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Complex analysis

Brennan's Conjecture

Brennan's conjecture, part 1: B(2)=1B(-2) = 1.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Complex analysis

Brennan's Conjecture

Brennan's conjecture, part 2: Bb(2)=1B_b(-2) = 1.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Field theory and polynomials

Sendov's conjecture

Sendov's conjecture* states that for a polynomial f(z)=(zr1)(zrn),(n2)f(z)=(z-r_{1})\cdots (z-r_{n}),\qquad (n\geq 2) with all roots r1,...,rnr_1, ..., r_n inside the closed unit disk z1|z| ≤ 1, each of the nn roots is at a distance no more than 11 from at least one critical point.

Source checked Jul 26, 20261 pinned Lean statementInspect problem