45 search results - page 7 / 9 » On Non-Polynomial Latin Squares |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicit...
COMBINATORICS
2000
13 years 7 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
FFA
2006
13 years 7 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
COMBINATORICS
2000
13 years 7 months ago
2000
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...