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 openGreen's Open Problems · Group theory

Ben Green's Open Problem 4

What is the largest product-free set in the alternating group AnA_n?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Real functions

Mathoverflow 235893

Assume for n>1n>1, f:RnRnf:\mathbb{R}^n\to\mathbb{R}^n is a bijection, where Rn\mathbb{R}^n is equipped with the standard topology. Does the connectedness of (the induced power set map) ff imply that of f1f^{-1}?

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

Erdős Problem 602

Does every almost-disjoint family of countably infinite sets whose pairwise intersections all have size ≠ 1 have Property B?

Formally: let α be any type, let (A_i)_{i ∈ I} be a family of countably infinite subsets of α such that for all i ≠ j, the intersection A_i ∩ A_j is finite and |A_i ∩ A_j| ≠ 1. Does there exist a 2-colouring f : α → Fin 2 such that no A_i is monochromatic?

This is an open question about Property B for almost-disjoint families with a forbidden intersection size of 1. Note:* This generalises the formulation in which the ground set is . Since every countably infinite set is in bijection with , the two formulations are equivalent, but working over an arbitrary ground type makes the statement apply immediately to, e.g., almost-disjoint families of countable subsets of an uncountable space.

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

Erdős Problem 517

If f(z) = ∑ aₖzⁿₖ is an entire function (with aₖ ≠ 0 for all k) such that nₖ / k → ∞, is it true that f assumes every value infinitely often?

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

Conjectures about the Mandelbrot and Multibrot sets

The density of hyperbolicity conjecture, stating that the set of all parameters c for which fun z ↦ z ^ 2 + c has an attracting cycle is dense in the Mandelbrot set.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openPapers · Harmonic analysis

Weak tiling problems

Problem 4.3.* Let ΩR\Omega \subset \mathbb{R} be a finite union of intervals and ν\nu a weak tiling measure for Ω\Omega. Must ν\nu be expressible as a convex combination of proper tiling measures?

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

Digit $2$ in base $3$ representation of $2^n$

For n>8n > 8, 2n2^n is not the the sum of distinct powers of 33. Expressed here in terms of the base 33 digits of nn.

This conjecture is equivalent to the halting of a 1515-state 22-symbol Turing Machine.

TODO(lezeau): Formalize the Turing Machine version of this problem.

Source: Hardness of Busy Beaver Value BB(15): https://link.springer.com/chapter/10.1007/978-3-031-72621-7_9 This is also https://arxiv.org/abs/2107.12475.

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

Erdős Problem 507: Equivalent

Let α(n)\alpha(n) be such that every set of nn points in the unit disk contains three points which determine a triangle of area at most α(n)\alpha(n). Estimate α(n)\alpha(n).

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

Erdős Problem 107

Let f(n)f(n) be minimal such that any f(n)f(n) points in R2ℝ^2, no three on a line, contain nn points which form the vertices of a convex nn-gon. Prove that f(n)=2n2+1f(n) = 2^{n-2} + 1.

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

Conjectures around homogeneous topological spaces

Problem 13 in [Ar2013]: Is it true that every infinite homogeneous compact hausdorff space contains a non-trivial convergent sequence?

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

Černý Conjecture

Černý Conjecture*: Every synchronizing DFA with nn states admits a synchronizing word of length at most (n1)2(n - 1)^2.

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

Erdős Problem 522

Let f(z)=0knϵkzkf(z)=\sum_{0\leq k\leq n} \epsilon_k z^k be a random polynomial, where ϵk{1,1}\epsilon_k\in \{-1,1\} independently uniformly at random for 0kn0\leq k\leq n.

Is it true that, if RnR_n is the number of roots of f(z)f(z) in {zC:z1}\{ z\in \mathbb{C} : \lvert z\rvert \leq 1\}, then

Rnn/21 \frac{R_n}{n/2}\to 1

almost surely?

There is some ambiguity as to whether the intended coefficient set is {1,1}\{-1, 1\} or {0,1}\{0, 1\}, see erdos_522.variants.zero_one for the alternate version.

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

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

Köthe conjecture: General Matrix

The Köthe conjecture: for any nil ideal I of R, the matrix ideal M_n(I) is a nil ideal of the matrix ring M_n(R).

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

Conjecture 19.25: 25»

Let GG and HH be finite groups of the same order with gGϕ(g)=hHϕ(h)\sum_{g \in G} \phi(|g|) = \sum_{h \in H} \phi(|h|), where ϕ\phi is the Euler totient function. Suppose that GG is simple. Is HH necessarily simple?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Real functions

Mathoverflow 347178: Bounded Only

Let f:RnR,n2f : \mathbb R^n \to \mathbb R, n \geq 2 be a C1C^1 function. Does the equality supxRnf(x)=supxRnf(x+f(x))\sup_{x \in \mathbb R^n}f(x) = \sup_{x\in \mathbb R^n} f(x+\nabla f(x)) hold when both suprema are finite?

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

Erdős Problem 623

Let XX be a set of cardinality ω\aleph_\omega and ff be a function from the finite subsets of XX to XX such that f(A)∉Af(A)\not\in A for all AA. Must there exist an infinite YXY\subseteq X that is independent - that is, for all finite BYB\subset Y we have f(B)∉Yf(B)\not\in Y?

Source checked Jul 26, 20261 pinned Lean statementInspect problem