mutually orthogonal Latin squares
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:abbreviation |
MOLS
|
| gptkbp:application |
cryptography
finite fields statistical design error correcting codes |
| gptkbp:defines |
A set of Latin squares of the same order such that every pair of squares is orthogonal.
|
| gptkbp:existence |
A complete set of n-1 MOLS exists if and only if there is a finite projective plane of order n.
|
| gptkbp:famousResult |
No pair of orthogonal Latin squares of order 6 exists (Euler's 36 officers problem).
|
| https://www.w3.org/2000/01/rdf-schema#label |
mutually orthogonal Latin squares
|
| gptkbp:maximumLoanAmount |
At most n-1 MOLS of order n can exist.
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:property |
If two Latin squares of order n are orthogonal, then when superimposed, each ordered pair of symbols occurs exactly once.
|
| gptkbp:relatedTo |
gptkb:Latin_square
gptkb:Sudoku projective plane orthogonal array |
| gptkbp:usedIn |
gptkb:geometry
combinatorics experimental design design theory |
| gptkbp:bfsParent |
gptkb:Latin_square
|
| gptkbp:bfsLayer |
7
|