Sciweavers

45 search results - page 1 / 9
» On Non-Polynomial Latin Squares
Sort
View
DCC
2004
IEEE
14 years 4 months ago
On Non-Polynomial Latin Squares
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
Otokar Grosek, Peter Horák, Tran van Trung
ARSCOM
1999
97views more  ARSCOM 1999»
13 years 4 months ago
The Size of the Smallest Strong Critical Set in a Latin Square
A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
John A. Bate, G. H. John van Rees
IJCM
2002
97views more  IJCM 2002»
13 years 4 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
DM
1999
69views more  DM 1999»
13 years 4 months ago
Maximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
David A. Drake, G. H. John van Rees, W. D. Wallis