All-even Latin squares (Q1924368): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Roland Haeggkvist / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jeannette C. M. Janssen / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Chester J. Salwach / rank | |||
Normal rank |
Revision as of 12:19, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | All-even Latin squares |
scientific article |
Statements
All-even Latin squares (English)
0 references
22 June 1997
0 references
Each row of a Latin square of order \(n\) or of a \(k\times n\) Latin rectangle with \(k\leq n\) can be thought of as a permutation of the elements in \(\{1,2,\dots,n\}\). The authors show that the proportion of Latin squares of order \(n\) for which all rows are even permutations is at most \(c^n\), where \(\sqrt{{3\over 4}}<c<1\). Coupled with work by Cameron and Kantor, this result establishes that for almost all Latin squares of order \(n\), the permutations given by the rows generate the symmetric group \(S_n\). The authors also show that for \(k\times n\) Latin rectangles with \(k\leq n-7\), the proportion of Latin rectangles for which all rows are even permutations is asymptotically equal to \(2^{-k}\), thereby indicating a ``quasi-random'' behavior for the rows.
0 references
Latin square
0 references
Latin rectangle
0 references
permutation
0 references
even permutations
0 references
symmetric group
0 references