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 openPapers · General topology

Conjectures around homogeneous topological spaces

Problem 16 in [Ar2013]: Is the cardinality of every homogeneous ω-monolithic compact hausdorff space not greater than 𝔠?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openarXiv · Number theory

A conjecture by Margulis on matrix groups

Let D be the diagonal group of SL_n(ℝ) where n ≥ 3. Then any relatively compact D-orbit in SL_n(ℝ) / SL_n(ℤ) is closed.

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

Mathoverflow 339137

Let P(x),Q(x)R[x]P(x), Q(x) ∈ ℝ[x] be two monic polynomials with non-negative coefficients. If R(x)=P(x)Q(x)R(x) = P(x)Q(x) is a 0,10,1 polynomial (coefficients only from {0,1}\{0,1\}), then P(x)P(x) and Q(x)Q(x) are also 0,10, 1 polynomials.

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 7070.

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

Bounded Burnside problem

Let GG be a finitely generated group, and assume there exists nn such that for every gg in GG, gn=1g^n = 1. Is GG necessarily finite?

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

Erdős Problem 70

*The relation at ω1\omega_1**: c(ω1,n)23\mathfrak{c} \to (\omega_1, n)^3_2 for finite n2n \ge 2, where ω1=1\omega_1 = \aleph_1 is the first uncountable ordinal.

Note that ω1\omega_1 is not a countable ordinal, so this is not directly an instance of the main Erdős problem (which asks for countable β\beta). Under CH, ω1=c.ord\omega_1 = \mathfrak{c}.\mathrm{ord}, making this a self-referential question about c.ord(c.ord,n)23\mathfrak{c}.\mathrm{ord} \to (\mathfrak{c}.\mathrm{ord}, n)^3_2.

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

De Giorgi's conjecture

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

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

Erdős Problem 10: Granville Soundararajan Odd

Granville and Soundararajan [GrSo98] have conjectured that at most 33 powers of 22 suffice for all odd integers, and hence at most 44 powers of 22 suffice for all even integers.

Ref: Granville, A. and Soundararajan, K., A Binary Additive Problem of Erdős and the Order of 22 mod p2p^2

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Geometry

Ben Green's Open Problem 41: Exists Better Bound

Is there a better bound than the best-known bound from [KrLe25]? This is an existential version of the main problem that does not require providing the bound explicitly.

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

Erdős Problem 213

Let n4n \geq 4. Are there nn points in R2\mathbb{R}^2, no three on a line and no four on a circle, such that all pairwise distances are integers?

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

Conjectures around homogeneous topological spaces

Problem 17 in [Ar2013]: Is it true that every nonempty ω-monolithic compact hausdorff space contains a point with a first countable neighborhood basis?

Note: Nonempty X is required since the conclusion asserts the existence of a point.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openBooks · Number theory

Bugeaud Collection of Conjectures and Open Questions: Fractional Parts of Powers

Problem 10.1. Are there a transcendental number α\alpha and a positive real number ξ\xi such that ξαn\lVert \xi \alpha^n \rVert tends to~00 as~nn tends to infinity? [Har19] (Trivial for α<1|\alpha| < 1)

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

Casas-Alvero Conjecture

The Casas-Alvero conjecture states that in characteristic zero, if a monic polynomial P has the Casas-Alvero property, then P = (X - α)ᵈ for some α.

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 7171.

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

Gap conjecture

If a finitely generated group has superpolynomial growth, then with respect to any finite generating set its growth function is at least ene^{\sqrt n} in Grigorchuk's preorder on growth functions, where the comparison is witnessed by linearly rescaling the radius.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Mathematical logic

Busy Beaver

Determine the value of the Busy Beaver function at n = 6.

Source checked Jul 26, 20261 pinned Lean statementInspect problem