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

Open problemEditorial · Number theory

Normality of π

The number π\pi is normal in base 1010, so every block of kk decimal digits has limiting frequency 10k10^{-k}.

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

The Curling Number Conjecture

The sequence will eventually reach 11.

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

Erdős Problem 1150

Is there some constant c>0c > 0 such that, for all large enough nn and all polynomials PP of degree nn with coefficients in {1,1}\{-1, 1\}, maxz=1P(z)>(1+c)n?\max_{|z|=1} |P(z)| > (1 + c) \sqrt{n}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openarXiv · Commutative algebra

Zariski Cancellation

The Zariski Cancellation Problem: every polynomial ring over a field k of characteristic 0 is cancellative.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openPapers · Algebraic geometry

Hartshorne Conjecture

There are no indecomposable vector bundles of rank 2 on Pn\mathbb{P}^n for n7n \ge 7. This is Conjecture 6.3 in [Har1974].

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

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

Kaplansky's Conjectures

The zero-divisor conjecture*

If G is torsion-free, then the group algebra K[G] has no non-trivial zero divisors.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Category theory

Mathoverflow 31809

Does there exist a category that is pretriangulated but not triangulated?

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

Erdős Problem 274

If GG is a group, can there exist an exact covering of GG by more than one coset of different sizes? (i.e. each element is contained in exactly one of the cosets.)

The conjectured answer is no: in every such exact covering, two of the subgroups have the same cardinality.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openHilbert Problems · Topological groups

Hilbert's Fifth Problem and the Hilbert–Smith Conjecture

Hilbert–Smith conjecture*: every locally compact topological group acting continuously and faithfully on a connected finite-dimensional topological manifold is a Lie group.

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

Erdős Problem 1133

Let C>0C>0. There exists ϵ>0\epsilon>0 such that if nn is sufficiently large the following holds.

For any x1,,xn[1,1]x_1,\ldots,x_n\in [-1,1] there exist y1,,yn[1,1]y_1,\ldots,y_n\in [-1,1] such that, if PP is a polynomial of degree m<(1+ϵ)nm<(1+\epsilon)n with P(xi)=yiP(x_i)=y_i for at least (1ϵ)n(1-\epsilon)n many 1in1\leq i\leq n, then maxx[1,1]P(x)>C.\max_{x\in [-1,1]}\lvert P(x)\rvert >C.

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

Erdős Problem 1038: I

What is the infimum of |{x ∈ ℝ : |f x| < 1}| over all nonconstant monic polynomials f such that all of its roots are real and contained in [-1,1]?

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

Erdős Problem 1176

Let GG be a graph with chromatic number 1\aleph_1. Is it true that there is a colouring of the edges with 1\aleph_1 many colours such that, in any countable colouring of the vertices, there exists a vertex colour containing all edge colours?

A problem of Erdős, Galvin, and Hajnal. The consistency of this was proved by Hajnal and Komjáth.

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

Erdős Problem 509

Let f(z)C[z]f(z) ∈ ℂ[z] be a monic non-constant polynomial. Can the set {zC:f(z)1}\{z ∈ ℂ : |f(z)| ≤ 1\} be covered by a set of closed discs the sum of whose radii is 2≤ 2?

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

Erdős Problem 1041

Let f(z)=i=1n(zzi)C[x]f(z) = \prod_{i=1}^{n} (z - z_i) \in \mathbb{C}[x] with zi<1|z_i| < 1 for all ii.

Conjecture: Must there always exist a path of length less than 2 in {zCf(z)<1}\{ z \in \mathbb{C} \mid |f(z)| < 1 \} which connects two of the roots of ff?

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

Exponentials conjectures and theorems

Four exponentials conjecture* Let x0,x1x_0, x_1 and y0,y1y_0, y_1 be Q\mathbb Q-linearly independent pairs of complex numbers, then some exiyje^{x_i y_j} is transcendental.

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

Furstenberg's `times p, times q` conjectures

Conjecture 1.3* (the ×p,×q\times p, \times q conjecture): the only atomless Borel probability measure on T\mathbb{T} which is both TpT_p- and TqT_q-invariant is the Lebesgue measure.

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

Erdős Problem 243

Let a1<a2<a_1 < a_2 < \dots be a sequence of integers such that limnanan12=1\lim_{n\to\infty} \frac{a_n}{a_{n-1}^2} = 1 and 1anQ\sum \frac{1}{a_n} \in \mathbb{Q}.

Then, for all sufficiently large n1n \ge 1, an=an12an1+1a_n = a_{n-1}^2 - a_{n-1} + 1.

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

Erdős Problem 996

Does there exists a positive constant C such that for all f ∈ L²[0,1] and all lacunary sequences n, if ‖f - fₖ‖₂ = O(1 / log log log k ^ C), then for almost every x, lim ∑ k ∈ Finset.range N, f (n k • x)) / N = ∫ t, f t ∂t?

Source checked Jul 26, 20261 pinned Lean statementInspect problem