Embeddings of generalized Latin squares in finite groups (Q313467): Difference between revisions

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)].