Defining sets for Latin squares given that they are based on groups
A partial Latin square is an \(n\) by \(n\) array with elements from a set of size \(n\), such that no element appears more than once in any row or column. If a partial Latin square can be completed to a unique Latin square within the main class of a Latin square, denoted \(M(L)\), then it is said to be a defining set in \(M(L).\) The density of a defining set is the ratio of the size of the defining set and the number of entries in the Latin square, \(n^2\). The authors show that the density of the smallest defining sets in \(M(G)\), where \(G\) is a group, approaches \(0\) as \(n\) approaches infinity. Additionally, they disprove a conjecture of Keedwell by constructing a defining set of density \({7}\over{16}\) for each member of an infinite class of non-cyclic groups.
- Completing Latin squares: Critical sets
- Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
- scientific article; zbMATH DE number 90345
- Completing Latin squares: Critical sets II
- Critical sets in latin squares and their application to minimal defining sets of designs
- scientific article; zbMATH DE number 3672317 (Why is no real title available?)
- scientific article; zbMATH DE number 1156612 (Why is no real title available?)
- scientific article; zbMATH DE number 1792651 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 786160 (Why is no real title available?)
- Tests for loop nuclei and a new criterion for a Latin square to be group-based
- What is the size of the smallest Latin square for which a weakly completable critical set of cells exists?
This page was built for publication: Defining sets for Latin squares given that they are based on groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869037)
