## Abstract Denote by Fin(υ) the set of all integral pairs (__t,s__) for which there exist three Latin squares of order υ on the same set having fine structure (__t,s__). We determine the set Fin(υ) for any integer __v__ ≥ 9. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 85–110, 2006
Cycle structure of autotopisms of quasigroups and latin squares
✍ Scribed by Douglas S. Stones; Petr Vojtěchovský; Ian M. Wanless
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 542 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
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 Atp(n) be the set of all autotopisms of Latin squares of order n. Whether a triple (α, β, γ) of permutations belongs to Atp(n) depends only on the cycle structures of α, β, and γ. We establish a number of necessary conditions for (α, β, γ) to be in Atp(n), and use them to determine Atp(n) for n⩽17. For general n, we determine if (α, α, α)∈Atp(n) (that is, if αis an automorphism of some quasigroup of order n), provided that either αhas at most three cycles other than fixed points or that the non‐fixed points of α are in cycles of the same length. © 2011 Wiley Periodicals, Inc. J Combin Designs
📜 SIMILAR VOLUMES
We define a near-automorphism a of a Latin square L to be an isomorphism such that L and aL differ only within a 2×2 subsquare. We prove that for all n ≥ 2 except n ∈{3, 4}, there exists a Latin square which exhibits a near-automorphism. We also show that if a has the cycle structure (2, n-2), then
## Abstract A Latin square is __pan‐Hamiltonian__ if the permutation which defines row __i__ relative to row __j__ consists of a single cycle for every __i__ ≠ __j__. A Latin square is __atomic__ if all of its conjugates are pan‐Hamiltonian. We give a complete enumeration of atomic squares for orde
## Abstract A latin square __S__ is isotopic to another latin square __S__′ if __S__′ can be obtained from __S__ by permuting the row indices, the column indices and the symbols in __S__. Because the three permutations used above may all be different, a latin square which is isotopic to a symmetric