Latin square

In combinatorics and in experimental design, a Latin square is an "n" × "n" array filled with "n" different symbols, each occurring exactly once in each row and exactly once in each column. An example of a 3×3 Latin square is
The name "Latin square" was inspired by mathematical papers by Leonhard Euler (1707–1783), who used Latin characters as symbols, but any set of symbols can be used: in the above example, the alphabetic sequence A, B, C can be replaced by the integer sequence 1, 2, 3. Euler began the general theory of Latin squares.
History.
The Korean mathematician Choi Seok-jeong was the first to publish an example of Latin squares of order nine, in order to construct a magic square in 1700, predating Leonhard Euler by 67 years.
Reduced form.
A Latin square is said to be "reduced" (also, "normalized" or "in standard form") if both its first row and its first column are in their natural order. For example, the Latin square above is not reduced because its first column is A, C, B rather than A, B, C.
Any Latin square can be reduced by permuting (that is, reordering) the rows and columns. Here switching the above matrix's second and third rows yields the following square:
This Latin square is reduced; both its first row and its first column are alphabetically ordered A, B, C.
Properties.
Orthogonal array representation.
If each entry of an "n" × "n" Latin square is written as a triple ("r","c","s"), where "r" is the row, "c" is the column, and "s" is the symbol, we obtain a set of "n"2 triples called the orthogonal array representation of the square. For example, the orthogonal array representation of the Latin square
is
where for example the triple (2, 3, 1) means that in row 2 and column 3 there is the symbol 1. Orthogonal arrays are usually written in array form where the triples are the rows, such as:
The definition of a Latin square can be written in terms of orthogonal arrays: 
This means that the "n"2 ordered pairs ("r", "c") are all the pairs ("i", "j") with 1 ≤ "i", "j" ≤ "n", once each. The same is true of the ordered pairs ("r", "s") and the ordered pairs ("c", "s").
The orthogonal array representation shows that rows, columns and symbols play rather similar roles, as will be made clear below.
Equivalence classes of Latin squares.
Many operations on a Latin square produce another Latin square (for example, turning it upside down).
If we permute the rows, permute the columns, and permute the names of the symbols of a Latin square, we obtain a new Latin square said to be "isotopic" to the first. Isotopism is an equivalence relation, so the set of all Latin squares is divided into subsets, called "isotopy classes", such that two squares in the same class are isotopic and two squares in different classes are not isotopic.
Another type of operation is easiest to explain using the orthogonal array representation of the Latin square. If we systematically and consistently reorder the three items in each triple (that is, permute the three columns in the array form), another orthogonal array (and, thus, another Latin square) is obtained. For example, we can replace each triple ("r","c","s") by ("c","r","s") which corresponds to transposing the square (reflecting about its main diagonal), or we could replace each triple ("r","c","s") by ("c","s","r"), which is a more complicated operation. Altogether there are 6 possibilities including "do nothing", giving us 6 Latin squares called the conjugates (also parastrophes) of the original square.
Finally, we can combine these two equivalence operations: two Latin squares are said to be "paratopic", also "main class isotopic", if one of them is isotopic to a conjugate of the other. This is again an equivalence relation, with the equivalence classes called "main classes", "species", or "paratopy classes". Each main class contains up to six isotopy classes.
Number.
There is no known easily computable formula for the number of Latin squares with symbols . The most accurate upper and lower bounds known for large are far apart. One classic result is that
A simple and explicit formula for the number of Latin squares was published in 1992, but it is still not easily computable due to the exponential increase in the number of terms. This formula for the number of Latin squares is
formula_2
where is the set of all {0, 1} matrices, is the number of zero entries in matrix , and is the permanent of matrix .
The table below contains all known exact values. It can be seen that the numbers grow exceedingly quickly. For each , the number of Latin squares altogether is times the number of reduced Latin squares .
For each , each isotopy class contains up to Latin squares (the exact number varies), while each main class contains either 1, 2, 3 or 6 isotopy classes.
The number of structurally distinct Latin squares (i.e. the squares cannot be made identical by means of rotation, reflexion, and/or permutation of the symbols) for = 1 up to 7 is 1, 1, 1, 12, 192, 145164, 1524901344 respectively .
Examples.
We give one example of a Latin square from each main class up to order five.
formula_3
formula_4
formula_5
They present, respectively, the multiplication tables of the following groups:
Transversals and rainbow matchings.
A transversal in a Latin square is a choice of "n" cells, where each row contains one cell, each column contains one cell, and there is one cell containing each symbol.
One can consider a Latin square as a complete bipartite graph in which the rows are vertices of one part, the columns are vertices of the other part, each cell is an edge (between its row and its column), and the symbols are colors. The rules of the Latin squares imply that this is a proper edge coloring. With this definition, a Latin transversal is a matching in which each edge has a different color; such a matching is called a rainbow matching.
Therefore, many results on Latin squares/rectangles are contained in papers with the term "rainbow matching" in their title, and vice versa.
Some Latin squares have no transversal. For example, when "n" is even, an "n"-by-"n" Latin square in which the value of cell "i,j" is ("i"+"j") mod "n" has no transversal. Here are two examples:formula_11In 1967, H. J. Ryser conjectured that, when "n" is odd, every "n"-by-"n" Latin square has a transversal.
In 1975, S. K. Stein and Brualdi conjectured that, when "n" is even, every "n"-by-"n" Latin square has a partial transversal of size "n"-1.
A more general conjecture of Stein is that a transversal of size "n"-1 exists not only in Latin squares but also in any "n"-by-"n" array of "n" symbols, as long as each symbol appears exactly "n" times.
Some weaker versions of these conjectures have been proved:
Algorithms.
For small squares it is possible to generate permutations and test whether the Latin square property is met. For larger squares, Jacobson and Matthews' algorithm allows sampling from a uniform distribution over the space of "n" × "n" Latin squares.
Applications.
Error correcting codes.
Sets of Latin squares that are orthogonal to each other have found an application as error correcting codes in situations where communication is disturbed by more types of noise than simple white noise, such as when attempting to transmit broadband Internet over powerlines.
Firstly, the message is sent by using several frequencies, or channels, a common method that makes the signal less vulnerable to noise at any one specific frequency. A letter in the message to be sent is encoded by sending a series of signals at different frequencies at successive time intervals. In the example below, the letters A to L are encoded by sending signals at four different frequencies, in four time slots. The letter C, for instance, is encoded by first sending at frequency 3, then 4, 1 and 2.
formula_12
The encoding of the twelve letters are formed from three Latin squares that are orthogonal to each other. Now imagine that there's added noise in channels 1 and 2 during the whole transmission. The letter A would then be picked up as:
In other words, in the first slot we receive signals from both frequency 1 and frequency 2; while the third slot has signals from frequencies 1, 2 and 3. Because of the noise, we can no longer tell if the first two slots were 1,1 or 1,2 or 2,1 or 2,2. But the 1,2 case is the only one that yields a sequence matching a letter in the above table, the letter A. 
Similarly, we may imagine a burst of static over all frequencies in the third slot:
Again, we are able to infer from the table of encodings that it must have been the letter A being transmitted. The number of errors this code can spot is one less than the number of time slots. It has also been proven that if the number of frequencies is a prime or a power of a prime, the orthogonal Latin squares produce error detecting codes that are as efficient as possible.
Mathematical puzzles.
The problem of determining if a partially filled square can be completed to form a Latin square is NP-complete.
The popular Sudoku puzzles are a special case of Latin squares; any solution to a Sudoku puzzle is a Latin square. Sudoku imposes the additional restriction that nine particular 3×3 adjacent subsquares must also contain the digits 1–9 (in the standard version). See also Mathematics of Sudoku.
The more recent KenKen puzzles are also examples of Latin squares.
Board games.
Latin squares have been used as the basis for several board games, notably the popular abstract strategy game Kamisado.
Agronomic research.
Latin squares are used in the design of agronomic research experiments to minimise experimental errors.
Heraldry.
The Latin square also figures in the arms of the Statistical Society of Canada, being specifically mentioned in its blazon. Also, it appears in the logo of the International Biometric Society.