The symmetric-group multifold-factorization conjecture

Let SnS_n denote the symmetric group of degree nn, and let “multifold-factorizable” have the meaning defined in the paper. Symmetric-group multifold-factorization conjecture. The symmetric group SnS_n is multifold-factorizable for all n2n\geq 2. The paper suggests this as a potentially easier statement to prove, but the supplied text gives no proof or disproof.

Sources & referencesView supporting material

Primary source

Mikhail Kabenyuk, “Factorizations of simple groups of order 168 and 360”, arXiv:2401.09306 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.