A random Hall-Paige conjecture
Alp M\"uyesser, Alexey Pokrovskiy

TL;DR
This paper proves a combinatorial generalization of the Hall-Paige conjecture for large groups, leading to solutions for longstanding problems in group sequenceability and transversals in multiplication tables.
Contribution
It provides a combinatorial proof of a broad generalization of the Hall-Paige conjecture, resolving multiple open problems in large finite groups.
Findings
Characterizes sequenceable groups and confirms all large non-abelian groups are sequenceable.
Characterizes large subsquares of group multiplication tables that admit transversals.
Provides a combinatorial approach to longstanding problems in group theory.
Abstract
A complete mapping of a group is a bijection such that is also bijective. Hall and Paige conjectured in 1955 that a finite group has a complete mapping whenever is the identity in the abelianization of . This was confirmed in 2009 by Wilcox, Evans, and Bray with a proof using the classification of finite simple groups. \par In this paper, we give a combinatorial proof of a far-reaching generalisation of the Hall-Paige conjecture for large groups. We show that for random-like and equal-sized subsets of a group , there exists a bijection such that is a bijection from to whenever in the abelianization of . We use this statement as a black-box to settle the following old problems in combinatorial group theory…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Chronic Lymphocytic Leukemia Research
