Embeddings of generalized Latin squares in finite groups
In this article, the authors prove results and present open problems concerning the existence and classification of embeddable generalized Latin squares. A generalized Latin square of order \(n\) is an \(n\times n\) array of symbols with no repetition in rows or columns. (The number of symbols in an order-\(n\) generalized Latin square can vary between \(n\) and \(n^2\).) Generalized Latin squares \(L\) and \(L'\) of like order and the same symbols are isomorphic if \(L'\) can be obtained from \(L\) by applying a set of row permutations followed by the same set of column permutations. (This notion of isomorphism can be used to separate generalized Latin squares into equivalence classes.) A generalized Latin square \(L\) can be embedded in a finite group \(G\) if \(L\) is isomorphic to some portion of the operation table for \(G\). \medskip The authors prove the following results: (1) for integers \(m,n\) with \(n\geq 2\) and \(n\leq m\leq \frac{n(n+1)}{2}\) there exists an embeddable symmetric generalized Latin square of order \(n\) with \(m\) distinct elements, and (2) for integers \(m,n\) with \(n\geq 3\) and \(n\leq m\leq n^2\) there exists an embeddable non-symmetric generalized Latin square of order \(n\) with \(m\) distinct elements. For the latter result, the case \(n=2\) requires \(m\in\{3,4\}\). \medskip For each of these results, the number of non-isomorphic embeddable squares is unknown in general, and this is stated as an open problem. However, results along these lines exist for orders \(3\), \(4\), and \(5\), and can be found, for example, in [\textit{G. A. Freiman}, Aequationes Math. 22, 140--152 (1981; Zbl 0489.20020)] and [\textit{H. V. Chen} et al., Util. Math. 96, 65--78 (2015; Zbl 1331.05043)].
- scientific article; zbMATH DE number 6470670
- Generalized Latin squares of order \(n\) with \(n^2-1\) distinct elements
- Non-commutative generalized Latin squares of order 5 with certain number of distinct elements
- Generalized Latin squares. II
- Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
- Some results on generalized Latin squares
- Embedding a latin square in a pair of orthogonal latin squares
- Generalized Latin squares and their defining sets
- Totally symmetric Latin squares with prescribed intersection numbers
- Signs on group Latin squares
- Small partial Latin squares that embed in an infinite group but not into any finite group
- Existence of generalized Latin squares which are not embeddable in any group
- Generalized Latin squares. II
- scientific article; zbMATH DE number 3847403 (Why is no real title available?)
- Latin squares in a Cayley table
- Generalized Latin squares of order \(n\) with \(n^2-1\) distinct elements
- scientific article; zbMATH DE number 2014439 (Why is no real title available?)
- Small partial Latin squares that cannot be embedded in a Cayley table
- MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES
- scientific article; zbMATH DE number 812082 (Why is no real title available?)
- Planar algebras associated to Latin squares are of subgroup-group-type
- scientific article; zbMATH DE number 6288955 (Why is no real title available?)
- scientific article; zbMATH DE number 6470670 (Why is no real title available?)
- Non-commutative generalized Latin squares of order 5 with certain number of distinct elements
- Latin squares over Abelian groups
This page was built for publication: Embeddings of generalized Latin squares in finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313467)
