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.
1 topic

20 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
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 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 openWikipedia · Associative algebras

Kaplansky's Conjectures

The idempotent conjecture*

If G is torsion-free, then K[G] has no non-trivial idempotents.

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

Erdős Problem 274

Let GG be a group, and let A={a1G1,,akGk}A = \{a_1G_1, \dots, a_kG_k\} be a finite system of left cosets of subgroups G1,,GkG_1, \dots, G_k of GG.

Herzog and Schönheim conjectured that if AA forms a partition of GG with k>1k > 1, then the indices [G:G1],,[G:Gk][G:G_1], \dots, [G:G_k] cannot be distinct.

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

Ben Green's Open Problem 29

Suppose that AA is a KK-approximate group (not necessarily abelian). Is there SAS \subset A, SKO(1)A|S| \gg K^{-O(1)} |A|, with S8A4S^8 \subset A^4?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
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 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 openKourovka Notebook · Group theory

Conjecture 20.76: 76»

Let GG be a finite pp-group and assume that all abelian normal subgroups of GG have order at most pkp^k. Is it true that every abelian subgroup of GG has order at most p2kp^{2k}?

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

The $S_3$-conjecture (conjugacy classes of distinct sizes)

Markel's S3S_3-conjecture* (1973): any nontrivial finite ah-group is isomorphic to S3S_3.

The conjecture is open in general; it is known to be true for solvable groups.

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

Bounded Burnside problem

Let GG be a finitely generated group, and assume there exists nn such that for every gg in GG, gn=1g^n = 1. Is GG necessarily finite?

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

Gap conjecture

If a finitely generated group has superpolynomial growth, then with respect to any finite generating set its growth function is at least ene^{\sqrt n} in Grigorchuk's preorder on growth functions, where the comparison is witnessed by linearly rescaling the radius.

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

Ben Green's Open Problem 18

Suppose that GG is a finite group, and let AG×GA \subset G \times G be a subset of density α\alpha. Is it true that there are αG3\gg_\alpha |G|^3 triples x,y,gx, y, g such that (x,y),(gx,y),(x,gy)(x, y), (gx, y), (x, gy) all lie in AA?

Note: A is taken as α\alpha-dense, i.e. AαG2|A| \ge \alpha |G|^2 [Au16, Question 2]

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

Green's Open Problem 36

Do the following exist, for arbitrarily large nn? An abelian group HH with H=n2+o(1)|H| = n^{2+o(1)}, together with subsets A1,...,An,B1,...,BnA_1, ..., A_n, B_1, ..., B_n satisfying AiBin2o(1)|A_i||B_i| \ge n^{2-o(1)} and Ai+Bi=AiBi|A_i + B_i| = |A_i||B_i|, such that the sets Ai+BiA_i + B_i are disjoint from the sets Aj+BkA_j + B_k (jkj \neq k)?

NOTE: according to [CKS05, 4.1], the conditions should be Ai+BjA_i + B_j disjoint from Aj+BkA_j + B_k for iki \neq k. See green_36.variants.cks05.

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

Green's Open Problem 36: Cks05

Variant using the exact simultaneous double product property from [CKS05, 4.1].

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

Ben Green's Open Problem 5

Which finite groups have the smallest biggest product-free sets?

We formalise this as: determine the supremum of exponents α\alpha such that every nontrivial finite group of order nn contains a product-free set of size cnα\geq c n^{\alpha} for some absolute constant c>0c > 0. (The trivial group is excluded since its only product-free subset is empty.) Kedlaya [Ke97] showed that α=11/14\alpha = 11/14 is admissible, and Green suggests this exponent may well be sharp; the candidate extremal family is the Ree groups 2G2(q){}^2G_2(q), q=32m+1q = 3^{2m+1}.

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

Ben Green's Open Problem 5: Sl Two

A good model problem would be to determine the largest product-free subsets of SL2(Fp)\mathrm{SL}_2(\mathbb{F}_p).

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

Babai–Seress Conjectures on the Diameter of Finite Groups

Babai–Seress Conjecture (Conjecture 1.5)**: There exists an absolute constant CC such that the diameter of the alternating group AnA_n satisfies diam(An)nC.\operatorname{diam}(A_n) \leq n^C. Reference: L. Babai and Á. Seress, On the diameter of permutation groups, European Journal of Combinatorics 13 (1992), Conjecture 1.5

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

Babai–Seress Conjectures on the Diameter of Finite Groups

Babai–Seress Conjecture (Conjecture 1.7)**: There exists an absolute constant CC such that every finite simple non-abelian group GG satisfies diam(G)(logG)C.\operatorname{diam}(G) \leq (\log |G|)^C. Reference: L. Babai and Á. Seress, On the diameter of permutation groups, European Journal of Combinatorics 13 (1992), Conjecture 1.7

Source checked Jul 26, 20261 pinned Lean statementInspect problem