AbstractA latin square is a matrix of size n×n with entries from the set {1,…,n}, such that each row and each column is a permutation on {1,…,n}. We show how to construct a latin square such that for any two distinct rows, the prefixes of length h of the two rows share at most about h2/n elements. This upper bound is close to optimal when contrasted with a lower bound derived from the Second Johnson bound [6]
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
A latin square of order n is an n × n array in which each row and each column contains each of the n...
AbstractLet L be a Latin square of order n with entries from {0, 1,…, n − 1}. In addition, L is said...
AbstractA latin square is a matrix of size n×n with entries from the set {1,…,n}, such that each row...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractLet Ln denote the set of n by n Latin squares. We show that it is possible to map from one s...
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 ...
AbstractA finite latin square is an n×n matrix whose entries are elements of the set {1,…,n} and no ...
AbstractThe classical definition of Latin squares is generalized by allowing multiple occurences of ...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
AbstractIn this paper we are concerned with finding an upper bound on Nq(n), the maximum number of L...
This thesis studies several topics in theoretical computer science. First, the author shows that $5n...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
A latin square of order n is an n × n array in which each row and each column contains each of the n...
AbstractLet L be a Latin square of order n with entries from {0, 1,…, n − 1}. In addition, L is said...
AbstractA latin square is a matrix of size n×n with entries from the set {1,…,n}, such that each row...
For every positive integer n greater than 4 there is a set of Latin squares of order n such that eve...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractLet Ln denote the set of n by n Latin squares. We show that it is possible to map from one s...
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 ...
AbstractA finite latin square is an n×n matrix whose entries are elements of the set {1,…,n} and no ...
AbstractThe classical definition of Latin squares is generalized by allowing multiple occurences of ...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n...
AbstractIn this paper we are concerned with finding an upper bound on Nq(n), the maximum number of L...
This thesis studies several topics in theoretical computer science. First, the author shows that $5n...
AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. In this ...
A latin square of order n is an n × n array in which each row and each column contains each of the n...
AbstractLet L be a Latin square of order n with entries from {0, 1,…, n − 1}. In addition, L is said...
DOI
Add to ORKG