A Latin square of order
is an
array that is a Latin rectangle with
.
Its
entries are chosen from
symbols, each appearing exactly once in every row and every
column. For example, the two Latin squares of order two are given by
|
(1)
|
the 12 Latin squares of order three are given by
|
(2)
|
and two of the 576 Latin squares of order 4 are given by
|
(3)
|
Latin squares correspond to minimum vertex colorings of the rook graph, which are illustrated above for
and 3.
The numbers
of Latin squares of order
, 2, ... are 1, 2, 12, 576,
161280, ... (OEIS A002860). The numbers
of isotopically distinct Latin
squares of order
, 2, ... are 1, 1, 1, 2, 2,
22, 564, 1676267, ... (OEIS A040082).
A pair of Latin squares is said to be orthogonal if the pairs formed by juxtaposing the two arrays
are all distinct. For example, the two Latin squares
|
(4)
|
are orthogonal. The numbers of unordered pairs of orthogonal Latin squares of order , 2, ... are 1, 0, 36, 3456, ... (OEIS A072377).
The count at order 1 includes the unique Latin square paired with itself.
The number of Latin squares of order with first row given by
is the same as the number of fixed diagonal Latin
squares of order
(i.e., the number of Latin squares of order
having all 1s along their main diagonals). For
, 2, ..., the numbers of such matrices
are 1, 1, 2, 24, 1344, 1128960, ... (OEIS A000479)
and the total number of Latin squares of order
is equal to this number times
.
A normalized, or reduced, Latin square is a Latin square with the first row and column given by . General formulas
for the number of normalized
Latin squares
are given by Nechvatal (1981), Gessel (1987), and Shao
and Wei (1992), but a sharp asymptotic equivalent
for
is not known (McKay and Wanless
2005, p. 336). The total number of Latin squares
of order
can then be computed from
|
(5)
|
The known growth on a logarithmic scale is (Linial and Luria 2014), where
denotes little-O
notation.
The numbers of normalized Latin squares of order , 2, ..., are summarized in the following table (OEIS
A000315). As of November 2026, exact values
are known only through order 11. The entries for
, 13, 14, and 15 are estimates (McKay and Rogoyski
1995).
| reference | ||
| 1 | 1 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 4 | |
| 5 | 56 | Euler (1782), Cayley (1890), MacMahon (1915; incorrect value) |
| 6 | 9408 | Frolov (1890) and Tarry (1900) |
| 7 | 16942080 | Frolov (1890; incorrect), Norton (1939; incomplete), Sade (1948), Saxena (1951) |
| 8 | 535281401856 | Wells (1967) |
| 9 | 377597570964258816 | Bammel and Rothstein (1975) |
| 10 | 7580721483160132811489280 | McKay and Rogoyski (1995) |
| 11 | 5363937773277371298119673540771840 | McKay and Wanless (2005) |
| 12 | McKay and Rogoyski (1995) | |
| 13 | McKay and Rogoyski (1995) | |
| 14 | McKay and Rogoyski (1995) | |
| 15 | McKay and Rogoyski (1995) |
Sudoku is a special case of a Latin square.
Greenhill et al. (2026) proved that a uniformly random Latin square of order has every row an even
permutation with probability
as
. Their stronger theorem prescribes which row, column, and symbol permutations
are even or odd,
subject to the necessary parity identity.
The fewest entries needed to specify a Latin square uniquely are studied using Latin square critical sets, minimal collections of entries with a unique completion.
A Latin square transversal contains exactly one cell from every row, column, and symbol class. A duplex contains exactly two cells from every row, column, and symbol class.
A coloring of a Latin square assigns colors to its cells so that cells sharing a row, column, or symbol have different colors. Its chromatic number is the least number
of colors in such an assignment, equivalently the chromatic
number of its Latin square graph. Shokri
and Akbari (2026) proved that the Cayley table of
the dihedral group of order
has chromatic number
when
is odd. This colors cells of the Cayley
table, not vertices of a Cayley graph.
Let denote the maximum number of pairwise
orthogonal Latin squares of order
. Rosin (2026) constructed four
such squares of order 22 and six of order 74. Combined with previous constructions,
these give
for every integer
and
for every integer
. His 33 improved lower bounds are summarized
below. These are existence bounds, not assertions of the exact values of
.
| lower bound for | orders |
| 4 | 22 |
| 6 | 60, 74 |
| 7 | 45, 50, 78, 85, 92, 98, 175, 183, 482 |
| 8 | 72, 90 |
| 9 | 54, 162, 192, 207, 225, 328, 335, 486 |
| 10 | 80 |
| 11 | 96, 324, 430, 442, 456, 469, 494 |
| 12 | 427 |
| 14 | 144 |
| 17 | 288 |
Rosin (2026) reports that GPT-6 Astra found the constructions, which he checked computationally, and that Claude independently reconstructed and checked them from their descriptions.