Sciweavers

165 search results - page 2 / 33
» On Completing Latin Squares
Sort
View
ARSCOM
1999
97views more  ARSCOM 1999»
13 years 5 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
COMBINATORICS
2000
74views more  COMBINATORICS 2000»
13 years 6 months ago
Frequency Squares and Affine Designs
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
Vassili C. Mavron
DCC
2008
IEEE
14 years 5 months ago
New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups
A partial difference set having parameters (n2, r(n - 1), n + r2 - 3r, r2 - r) is called a Latin square type partial difference set, while a partial difference set having paramete...
John B. Polhill
DCC
2004
IEEE
14 years 5 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
DM
1999
69views more  DM 1999»
13 years 5 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