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.
All topics

1194 of 1194 statement records

17 source collections · 43 mathematical fields

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 openPapers · Partial differential equations

De Giorgi's conjecture

De Giorgi's conjecture holds in dimension n8n ≤ 8.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Dynamical systems

Conjectures about the Mandelbrot and Multibrot sets

The density of hyperbolicity conjecture for Multibrot sets, stating that the set of all parameters c for which fun z ↦ z ^ n + c has an attracting cycle is dense in multibrotSet n. Note that we need to require 2 ≤ n because the conjecture is trivially false for n = 1.

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

Fuglede's conjecture in dimensions 1 and 2: Dim 1

Fuglede's conjecture* in one dimension: A bounded subset of ℝ with positive Lebesgue measure is spectral iff it tiles ℝ by translation.

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

Erdős Problem 1

If A{1,...,N}A\subseteq\{1, ..., N\} with A=n|A| = n is such that the subset sums aSa\sum_{a\in S}a are distinct for all SAS\subseteq A then

N2n. N \gg 2 ^ n.
Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Geometry

Erdős Problem 507: Lower

Estimate a lower bound forα(n)\alpha(n).

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

Erdős Problem 1084: Triangular Optimal D2

Erdős conjectured that the triangular lattice is best possible in 2D, in particular that f2(3n2+3n+1)<9n2+3nf_2(3n^2 + 3n + 1) < 9n^2 + 3n.

Note: in [Er75f] is read 9n2+6n9n^2 + 6n, but this seems to be a typo.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openPapers · General topology

Conjectures around homogeneous topological spaces

Problem 14 in [Ar2013]: Is it possible to represent an arbitrary compact hausdorff space as an image of a homogeneous compact space under a continuous mapping?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Field theory and polynomials

Erdős Problem 522: Zero One

Let f(z)=0knϵkzkf(z)=\sum_{0\leq k\leq n} \epsilon_k z^k be a random polynomial, where ϵk{0,1}\epsilon_k\in \{0,1\} independently uniformly at random for 0kn0\leq k\leq n.

Is it true that, if RnR_n is the number of roots of f(z)f(z) in {zC:z1}\{ z\in \mathbb{C} : \lvert z\rvert \leq 1\}, then

Rnn/21 \frac{R_n}{n/2}\to 1

almost surely?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openOpen Quantum Problems · Linear algebra

Open Quantum Problem 23: SIC-POVMs

Benchmark open subproblem: existence of a SIC-POVM in dimension 6868.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Associative algebras

Köthe conjecture: Two By Two Matrix

The Köthe conjecture: for any nil ideal I of R, the matrix ideal M_2(I) is a nil ideal of the matrix ring M_2(R).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openKourovka Notebook · Group theory

Conjecture 20.76: 76»

Let GG be a finite pp-group and assume that all abelian normal subgroups of GG have order at most pkp^k. Is it true that every abelian subgroup of GG has order at most p2kp^{2k}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openPapers · Real functions

Voronovskaja-type Formula for the Bezier Variant of the Bernstein Operators: Bezier Bernstein Operators

Conjecture: Voronovskaja-type formula for Bézier-Bernstein operators with shape parameter α>0\alpha > 0, α1\alpha \neq 1.

The source asks for sufficiently smooth functions. This concrete version uses ContDiffOn ℝ 2 f I as a readable baseline regularity assumption; since the domain is the compact interval [0,1][0,1], this also explains why no separate boundedness assumption is included here. The variants below record the unknown smoothness threshold more explicitly.

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

Erdős Problem 70

Erdős Problem 70*: Let c\mathfrak{c} be the cardinality of the continuum, let β\beta be a countable ordinal, and let 2n<ω2 \le n < \omega. Is it true that c(β,n)23\mathfrak{c} \to (\beta, n)^3_2?

Note: The cases n3n \le 3 are trivially true (see omega_three), so the genuine content of the conjecture begins at n=4n = 4.

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 openPapers · Partial differential equations

De Giorgi's conjecture

De Giorgi's conjecture holds in dimension n=4n = 4.

Source checked Jul 26, 20261 pinned Lean statementInspect problem