Diagonal groups and arcs over groups
R. A. Bailey, Peter J. Cameron, Michael Kinyon, Cheryl E. Praeger

TL;DR
This paper explores the structure of partitions and Latin squares related to diagonal groups over groups, extending previous work to more complex configurations and connecting them to arcs in projective spaces.
Contribution
It generalizes earlier results on Cartesian lattice partitions to cases with more partitions, investigates their group-theoretic properties, and links these structures to arcs in finite projective spaces.
Findings
For $m=2$, the structure reduces to mutually orthogonal Latin squares.
In the case $m>2$, the groups involved may all be isomorphic, but this is not proven.
Under certain conditions, the group $G$ must be abelian with specific automorphisms.
Abstract
In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for , a set of partitions of a set , any of which are the minimal non-trivial elements of a Cartesian lattice, either form a Latin square (if ), or generate a join-semilattice of dimension associated with a diagonal group over a base group . In this paper we investigate what happens if we have partitions with , any of which are minimal elements of a Cartesian lattice. If , this is just a set of mutually orthogonal Latin squares. We consider the case where all these squares are isotopic to Cayley tables of groups, and give an example to show the groups need not be all isomorphic. For , things are more restricted. Any of the partitions generate a join-semilattice admitting a diagonal group over a group . It may be that the…
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
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · graph theory and CDMA systems
