When Is There a Latin Power Set?
A set of \(n\) permutations on a set of \(n\) symbols is sharply transitive if no two permutations map the same symbol to the same position. So a sharply transitive set of \(n\) permutations of \(n\) symbols forms a Latin square of order \(n\). If each set of \(k\)th powers, for \(1 \leq k \leq m\), of such permutations is sharply transitive, then associated with them is a collection of \(m\) mutually orthogonal Latin squares, known as a Latin power set. In this paper, the author discusses two conjectures on the existence of Latin power sets. The first conjecture is that if \(n \geq 4\) and \(\neq 6\), then there exists a Latin power set containing two Latin squares of order \(n\). The second conjecture is that for every even \(n \geq 8\), there exists a set of permutations each of which fixes one symbol while the other \(n-1\) symbols form a single cycle, which yields a pair of orthogonal Latin squares.
- Some new Latin power sets not based on groups
- Packing of permutations into Latin squares
- scientific article; zbMATH DE number 54777 (Why is no real title available?)
- scientific article; zbMATH DE number 718659 (Why is no real title available?)
- On a method of construction of orthogonal quasigroup systems by means of groups
- Answers to questions by Dénes on Latin power sets
This page was built for publication: When Is There a Latin Power Set?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361616)
