Brennan's Conjecture
Brennan's conjecture, part 2: .
Questions, not proof records
Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.
sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.1194 of 1194 statement records
17 source collections · 43 mathematical fields
Brennan's conjecture, part 2: .
Is the Euler-Mascheroni constant irrational?
De Giorgi's conjecture holds in dimension .
Bogdan Grechuk has observed that is not the sum of a prime and at most powers of , and pointed out that parity considerations, coupled with the fact that there are many integers not the sum of a prime and powers of suggest that there exist infinitely many even integers which are not the sum of a prime and at most powers of ).
Is rotations enough?
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?
Problem 2 in [Ar2013]: Give an example in ZFC of a weakly first- countable compact Hausdorff space X such that .
Note: [Ar2013] uses a blanket convention that all spaces are Tychonoff and "compact" means compact Hausdorff.
Problem 10.2. To prove that does not tend to 0 as n tends to infinity.
The second Cuboid conjecture
Benchmark open subproblem: existence of a SIC-POVM in dimension .
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".
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, or .
The Gompertz constant is transcendental.
De Giorgi's conjecture holds in dimension .
Does every graph with chromatic number contain a countable subgraph which is infinitely connected?
Can the Cohn-Elkies scheme be used to prove the optimal bound for circle-packings in 2 dimensions?
Erdős [Er46] asked whether every set of distinct points in determines many distinct distances.
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.
Problem 10.3. To prove that there exists a positive real number~ such that , for every~. Posed by Mahler [Mah53].
The third Cuboid conjecture