AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-orthogonal n × n latin squares each obtained from the addition table of a cyclic group of order n by permuting its rows. This result complements the exclusions which can be derived directly from the Bruck-Ryser theorem
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractThis paper shows how to construct a Latin square orthogonal to its transpose for every order...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
Two n×n Latin squares L1,L2 are said to be orthogonal if, for every ordered pair (x, y) of symbols, ...
AbstractIt is well known that if n is even, the addition table for the integers modulo n (which we d...
AbstractWe prove that there exists a pair of orthogonal diagonal Latin squares of order v with missi...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractA latin square of order n possessing a cyclic automorphism of order n is said to be diagonal...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractThe main result of this paper is that for any pair of orthogonal Latin squares of side k, th...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractThis paper shows how to construct a Latin square orthogonal to its transpose for every order...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
Two n×n Latin squares L1,L2 are said to be orthogonal if, for every ordered pair (x, y) of symbols, ...
AbstractIt is well known that if n is even, the addition table for the integers modulo n (which we d...
AbstractWe prove that there exists a pair of orthogonal diagonal Latin squares of order v with missi...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractA latin square of order n possessing a cyclic automorphism of order n is said to be diagonal...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractThe main result of this paper is that for any pair of orthogonal Latin squares of side k, th...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
DOI
Add to ORKG