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

234 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openWikipedia · Group theory

Leinster Groups

Conjecture:* Are there infinitely many Leinster groups?

This asks whether there exist infinitely many (non-isomorphic) finite groups that are Leinster groups.

Formalized via the negation of "Does there exist an n such that all Leinster groups have order less than n".

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

Vaught conjecture

The Vaught conjecture states that for a countable language L and a complete L-Theory T the number of countable models of T (up to isomorphism) is finite, 0\aleph_0 or 202^{\aleph_0}.

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

Gottschalk's surjunctivity conjecture

Gottschalk's surjunctivity conjecture* (1973): every group is surjunctive. That is, for every group G and every finite alphabet A, every injective cellular automaton on A^G is surjective.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Special functions

Open questions on transcendence of numbers

Γ(1/n)\Gamma(1/n) for n ≥ 2 is transcendental.

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

The Bing-Borsuk Conjecture

The Bing-Borsuk Conjecture: every nn-dimensional homogeneous absolute neighborhood retract is a topological nn-manifold. A topological space XX is an nn-dimensional manifold when T2Space X ∧ Nonempty (ChartedSpace (Fin n → ℝ) X). The hypothesis [MetrizableSpace X] implies T2Space X so this does not appear in the conclusion.

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

Inverse Galois problem

The Inverse Galois Problem: every finite group is isomorphic to the Galois group of a Galois extension of the rationals.

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

Mean value problem

Given a complex polynomial pp of degree d2d ≥ 2 and a complex number zz there is a critical point cc of pp, such that p(z)p(c)/zcp(z)|p(z)-p(c)|/|z-c| ≤ |p'(z)|.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Linear algebra

Determinantal conjecture

Does the determinant of the sum A+BA + B of two n×nn \times n normal complex matrices AA and BB always lie in the convex hull of the n!n! points i(λ(A)i+λ(B)σ(i))\prod_i (\lambda(A)_i + \lambda(B)_{\sigma(i)})? Here the numbers λ(A)i\lambda(A)_i and λ(B)i\lambda(B)_i are the eigenvalues of AA and BB, and σ\sigma is an element of the symmetric group SnS_n.

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

Inscribed square problem

Inscribed square problem* Does every Jordan curve admit an inscribed square?

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
Source labels openWikipedia · Linear algebra

Hadamard's conjecture

There exists a Hadamard matrix for all n=4kn = 4k.

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

Inscribed square problem

Inscribed rectangle problem* Does every Jordan curve admit inscribed rectangles of any given aspect ratio?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Linear algebra

Hadamard's conjecture: «167»

The smallest order for which no Hadamard matrix is presently known is 668=4167668 = 4 * 167.

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

Packing

What is the smallest square that can contain 11 unit squares?

Reference: Wikipedia

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

Packing

What is the smallest square that can contain 17 unit squares?

Reference: Wikipedia

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

Packing

What is the smallest circle that can contain 3 unit squares?

Reference: Wikipedia

Source checked Jul 26, 20261 pinned Lean statementInspect problem