AbstractIt is well-known that one may construct a 4-class association scheme on the positions of a Latin square, where the relations are the identity, being in the same row, being in the same column, having the same entry, and everything else. We describe the subconstituent (Terwilliger) algebras of such an association scheme
A finite latin square is an n × n matrix whose entries are elements of the set {1,...,n} and no elem...
AbstractOne of the classical families of association schemes is known as the Johnson schemes J(n,d)....
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
AbstractIt is well-known that one may construct a 4-class association scheme on the positions of a L...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
AbstractIt is shown that the number ln of all distinct Latin squares of the nth order appears as a s...
AbstractA finite latin square is an n×n matrix whose entries are elements of the set {1,…,n} and no ...
Cycle structures of autotopisms of Latin squares determine all possible patterns of this kind of des...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
summary:We derive necessary and sufficient conditions for there to exist a latin square of order $n$...
We show that for any Latin square L of order 2m, we can partition the rows and columns of L into pai...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
We prove several results about substructures in Latin squares. First, we explain how to adapt our re...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
A “Latin square of order n” is an “n by n” array of the symbols 1, 2, ... , n, such that each symbol...
A finite latin square is an n × n matrix whose entries are elements of the set {1,...,n} and no elem...
AbstractOne of the classical families of association schemes is known as the Johnson schemes J(n,d)....
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
AbstractIt is well-known that one may construct a 4-class association scheme on the positions of a L...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
AbstractIt is shown that the number ln of all distinct Latin squares of the nth order appears as a s...
AbstractA finite latin square is an n×n matrix whose entries are elements of the set {1,…,n} and no ...
Cycle structures of autotopisms of Latin squares determine all possible patterns of this kind of des...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
summary:We derive necessary and sufficient conditions for there to exist a latin square of order $n$...
We show that for any Latin square L of order 2m, we can partition the rows and columns of L into pai...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
We prove several results about substructures in Latin squares. First, we explain how to adapt our re...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
A “Latin square of order n” is an “n by n” array of the symbols 1, 2, ... , n, such that each symbol...
A finite latin square is an n × n matrix whose entries are elements of the set {1,...,n} and no elem...
AbstractOne of the classical families of association schemes is known as the Johnson schemes J(n,d)....
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
DOI
Add to ORKG