Cycle structure of autotopisms of quasigroups and Latin squares
Douglas S. Stones, Petr Vojt\v{e}chovsk\'y, Ian M. Wanless

TL;DR
This paper investigates the cycle structures of autotopisms of Latin squares, establishing necessary conditions, determining autotopisms for small orders, and characterizing automorphisms of quasigroups under specific cycle constraints.
Contribution
It provides new necessary conditions for autotopisms based on cycle structures and fully determines autotopisms for Latin squares of order up to 17, also characterizing automorphisms under certain cycle conditions.
Findings
Determined autotopisms for Latin squares of order up to 17.
Established necessary cycle structure conditions for autotopisms.
Characterized when a permutation is an automorphism of a quasigroup under specific cycle constraints.
Abstract
An autotopism of a Latin square is a triple of permutations such that the Latin square is mapped to itself by permuting its rows by , columns by , and symbols by . Let be the set of all autotopisms of Latin squares of order . Whether a triple of permutations belongs to depends only on the cycle structures of , and . We establish a number of necessary conditions for to be in , and use them to determine for . For general we determine if (that is, if is an automorphism of some quasigroup of order ), provided that either has at most three cycles other than fixed points or that the non-fixed points of are in cycles of…
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
Topicsgraph theory and CDMA systems · Mathematics and Applications · History and Theory of Mathematics
