19.35 (2018)

Solved

Let $G$ be a finite group of order $n$. Is it true that for every factorization $n = a_1 \cdots a_k$ there exist subsets $A_1, \dots, A_k$ such that $|A_1| = a_1, \dots, |A_k| = a_k$ and $G = A_1 \cdots A_k$?

Progress

No, it is not true. A counterexample with $k = 3$ is given by the alternating group on 4 letters $G = A_4$ and $(a_1, a_2, a_3) = (2, 3, 2)$. (G. M. Bergman, Letter of 19 December 2019, https://math.berkeley.edu/~gbergman/papers/gp_factzn.pdf.)

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.