AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin squares of order 24, from 3 (established in 1960 by Bose and Shrikhande (Trans. Amer. Math. Soc. 95 (1960), 191–209)) to 4. We obtain 7 sets of four squares from 7 sets of 3 pairwise orthogonal orthomorphisms of group Z6 ⊕ Z2 ⊕ Z2 which were found by a non-exhaustive computer search
Two n×n Latin squares L1,L2 are said to be orthogonal if, for every ordered pair (x, y) of symbols, ...
AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthog...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is pr...
AbstractLet L∗ denote the set of integers n such that there exists an idempotent Latin square of ord...
AbstractLet N(n) be the maximal number of mutually orthogonal Latin squares of order n and let nr be...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is sh...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
Let L* denote the set of integers n such that there exists an idempotent Latin square of order n wit...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
Two n×n Latin squares L1,L2 are said to be orthogonal if, for every ordered pair (x, y) of symbols, ...
AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthog...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is pr...
AbstractLet L∗ denote the set of integers n such that there exists an idempotent Latin square of ord...
AbstractLet N(n) be the maximal number of mutually orthogonal Latin squares of order n and let nr be...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is sh...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
Let L* denote the set of integers n such that there exists an idempotent Latin square of order n wit...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
Two n×n Latin squares L1,L2 are said to be orthogonal if, for every ordered pair (x, y) of symbols, ...
AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthog...
AbstractIt is shown that if n ≡ 15 mod 18 then it is impossible to find a complete set of pairwise-o...