Titlebook: Designs 2002; Further Computationa W. D. Wallis Book 2003Latest edition Springer Science+Business Media New York 2003 algorithms.computer.c

1分開(kāi)

Sets of Steiner Triple Systems of Order 9 Revisited,We determine all minimal large sets of 8 Steiner triple systems of order 9 (STS(9)); there are precisely four pairwise nonisomorphic solutions. We also classify all maximal sets of STS(9) which mutually intersect in the same number of triples (uniformly intersecting sets).

Fissure

FUSE

Institution

放肆的你

污點(diǎn)

https://doi.org/10.1007/978-3-322-90425-6he profile and projections of Hadamard matrices. A summary is then given which considers inequivalence of Hadamard matrices of orders up to 44..The final two sections give algorithms for constructing orthogonal designs, short amicable and amicable sets for use in the Kharaghani array.

TRUST

https://doi.org/10.1007/978-3-322-90425-6based on an analysis of group actions and improves on Burnside’s table of marks approach [15]. In particular, no knowledge of the full subgroup lattice of the symmetric group on the point set is needed.

EXALT

folliculitis

Flat-Feet

https://doi.org/10.1007/978-3-322-90425-6es and defining sets of the triple system and the latin trades and critical sets of the square..We apply these ideas and construct new families of minimal defining sets for triple systems associated with .(., 3).