A random Hall-Paige conjecture
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 for large groups. (1) We characterise sequenceable groups, that is, groups which admit a permutation of their elements such that the partial products , , are all distinct. This resolves a problem of Gordon from 1961 and confirms conjectures made by several authors, including Keedwell's 1981 conjecture that all large non-abelian groups are sequenceable. We also characterise the related -sequenceable groups, addressing a problem of Ringel from 1974. (2) We confirm in a strong form a conjecture of Snevily from 1999 by characterising large subsquares of multiplication tables of finite groups that admit transversals. Previously, this characterisation was known only for abelian groups of odd order (by a combination of papers by Alon and Dasgupta-K\'arolyi-Serra-Szegedy and Arsovski).
Cite
@article{arxiv.2204.09666,
title = {A random Hall-Paige conjecture},
author = {Alp Müyesser and Alexey Pokrovskiy},
journal= {arXiv preprint arXiv:2204.09666},
year = {2025}
}
Comments
73 pages, final version, to appear in Inventiones Mathematicae