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 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 · Special functions

Open questions on irrationality of numbers

Is the Euler-Mascheroni constant γ\gamma irrational?

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=7n = 7.

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

Erdős Problem 10: Grechuk

Bogdan Grechuk has observed that 11171751461117175146 is not the sum of a prime and at most 33 powers of 22, and pointed out that parity considerations, coupled with the fact that there are many integers not the sum of a prime and 22 powers of 22 suggest that there exist infinitely many even integers which are not the sum of a prime and at most 33 powers of 22).

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

Erdős Problem 508

The Hadwiger–Nelson problem asks: How many colors are required to color the plane such that no two points at distance 1 from each other have the same color?

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

Conjectures about Weakly First Countable spaces

Problem 2 in [Ar2013]: Give an example in ZFC of a weakly first- countable compact Hausdorff space X such that 𝔠<X𝔠 < |X|.

Note: [Ar2013] uses a blanket convention that all spaces are Tychonoff and "compact" means compact Hausdorff.

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

Source checked Jul 26, 20261 pinned Lean statementInspect problem
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 openPapers · Partial differential equations

De Giorgi's conjecture

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

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

Erdős Problem 1068

Does every graph with chromatic number 1\aleph_1 contain a countable subgraph which is infinitely connected?

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

Green's Open Problem 42

Can the Cohn-Elkies scheme be used to prove the optimal bound for circle-packings in 2 dimensions?

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

Erdős Problem 89

Erdős [Er46] asked whether every set of nn distinct points in R2\mathbb{R}^2 determines nlogn\gg \frac{n}{\sqrt{\log n}} many distinct distances.

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

Conjectures about Weakly First Countable spaces

Problem 3 in [Ar2013]: Give an example in ZFC of a weakly first- countable compact Hausdorff space which is not first countable.

Note: [Ar2013] uses a blanket convention that all spaces are Tychonoff and "compact" means compact Hausdorff.

Source checked Jul 26, 20261 pinned Lean statementInspect problem