In this paper, we show that there exists an automorphism free latin square graph of order n for all n a 7 and that the number of such graphs goes to infinity with n. These results are then applied to the construction of automorphism free Steiner triple systems.
Near-automorphisms of Latin squares
โ Scribed by Nicholas J. Cavenagh; Douglas S. Stones
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 560 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
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 L exists if and only if n โก 2 (mod 4), and can be constructed from a special type of partial orthomorphism. Along the way, we generalize a theorem by Marshall Hall, which states that any Latin rectangle can be extended to a Latin square. We also show that if a has at least 2 fixed points, then L must contain two disjoint non-trivial subsquares.
๐ SIMILAR VOLUMES
## Abstract In this paper, it is shown that a latin square of order __n__ with __n__โโฅโ3 and __n__โโ โ6 can be embedded in a latin square of order __n__^2^ which has an orthogonal mate. A similar result for idempotent latin squares is also presented. ยฉ 2005 Wiley Periodicals, Inc. J Combin Designs 1