Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
combinatorics |
| gptkbp:application |
coding theory
cryptography statistical design of experiments |
| gptkbp:existence |
for order n, at most n-1 mutually orthogonal Latin squares can exist
|
| https://www.w3.org/2000/01/rdf-schema#label |
orthogonal Latin square
|
| gptkbp:namedFor |
gptkb:Leonhard_Euler
|
| gptkbp:order |
n
|
| gptkbp:property |
two Latin squares of the same order are orthogonal if, when superimposed, every ordered pair of symbols occurs exactly once
|
| gptkbp:relatedTo |
gptkb:Latin_square
gptkb:mutually_orthogonal_Latin_squares Euler's 36 officers problem |
| gptkbp:usedIn |
gptkb:geometry
experimental design error correcting codes |
| gptkbp:bfsParent |
gptkb:Latin_square
|
| gptkbp:bfsLayer |
7
|