Colouring bijections of finite -groups
arXiv:2603.20084
Abstract
Let be a finite group. A bijection is a \emph{colouring bijection} if the three maps \[ Δ^{+}\colon x\mapsto x\,σ(x), \qquad Δ^{-}\colon x\mapsto x^{-1}σ(x), \qquad Δ^{c}\colon x\mapsto σ(x)^{-1}x\,σ(x) \] are again bijections of . The first two conditions say that is a strong complete mapping. The third is a genuinely nonabelian requirement. Our main theorem is that every noncyclic -group not isomorphic to the modular group admits a colouring bijection. This is the exact analogue, for colouring bijections, of the theorem of Akhtar and Gagola on strong complete mappings. The notion has three equivalent readings. A colouring bijection properly colours the Cayley graph with colours. It determines a triple of mutually orthogonal translation Latin squares based on . In the orthomorphism graph of that triple is a triangle through the Cayley table. It also determines a common transversal of three arrays attached to . These are the multiplication table, the division table, and the operation table of the conjugation quandle. The last of them is not a Latin square. Two consequences follow. Every noncyclic -group carries three mutually orthogonal Latin squares of order based on . Moreover for every such group.
arXiv commentExtended version with additional results and improved discussion, title correction