|
gptkbp:instanceOf
|
combinatorics
|
|
gptkbp:application
|
gptkb:geometry
design of experiments
error correcting codes
|
|
gptkbp:defines
|
n x n array filled with n different symbols, each occurring exactly once in each row and column
|
|
gptkbp:field
|
gptkb:mathematics
combinatorics
|
|
gptkbp:generalizes
|
permutation matrix
|
|
gptkbp:hasProperty
|
isotopy
transversal
autotopism
equivalence classes
paratopy
|
|
gptkbp:hasVariant
|
gptkb:mutually_orthogonal_Latin_squares
gptkb:reduced_Latin_square
normalized Latin square
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Latin squares
|
|
gptkbp:minimumOrder
|
1
|
|
gptkbp:namedAfter
|
gptkb:Latin_language
|
|
gptkbp:notation
|
L(n) for order n
|
|
gptkbp:numberOfLatinSquaresOfOrder3
|
12
|
|
gptkbp:numberOfLatinSquaresOfOrder4
|
576
|
|
gptkbp:numberOfLatinSquaresOfOrder5
|
161280
|
|
gptkbp:openProblem
|
existence of orthogonal Latin squares for all orders except 2 and 6
|
|
gptkbp:property
|
each symbol appears once per row and column
|
|
gptkbp:relatedTo
|
gptkb:magic
gptkb:Sudoku
gptkb:Graeco-Latin_square
gptkb:orthogonal_Latin_squares
gptkb:quasigroup
group theory
block design
|
|
gptkbp:studiedBy
|
gptkb:Leonhard_Euler
|
|
gptkbp:usedIn
|
gptkb:Latin_hypercube_sampling
gptkb:Latin_rectangle
coding theory
cryptography
statistics
experimental design
graph theory
algebraic structures
error detection
finite fields
puzzle design
tournament scheduling
|
|
gptkbp:bfsParent
|
gptkb:MacMahon_Squares
gptkb:Rota's_basis_conjecture
gptkb:n-queens_problem
gptkb:Magic_Squares
|
|
gptkbp:bfsLayer
|
7
|