## Abstract A __Steiner quadruple system__ of order __v__ (briefly SQS (__v__)) is a pair (__X__, $\cal B$), where __X__ is a __v__βelement set and $\cal B$ is a set of 4βelement subsets of __X__ (called __blocks__ or __quadruples__), such that each 3βelement subset of __X__ is contained in a uniqu
Overlarge sets of disjoint Steiner quadruple systems
β Scribed by Luc Teirlinck
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 152 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
In this article, we construct overlarge sets of disjoint S(3, 4, 3 n -1) and overlarge sets of disjoint S(3, 4, 3 n + 1) for all n β₯ 2. Up to now, the only known infinite sequence of overlarge sets of disjoint S(3, 4, v) were the overlarge sets of disjoint S(3, 4, 2 n ) obtained from the oval conics of desarguesian projective planes of order 2 n .
π SIMILAR VOLUMES
Steiner quadruple system of order v is a 3&(v, 4, 1) design and will be denoted SQS(v). Using the classification of finite 2-transitive permutation groups all SQS(v) with a flag-transitive automorphism group are completely classified, thus solving the ``still open and longstanding problem of classif
## Abstract An improved product construction is presented for rotational Steiner quadruple systems. Direct constructions are also provided for small orders. It is known that the existence of a rotational Steiner quadruple system of order Ο +1 implies the existence of an optimal optical orthogonal co
## Abstract A Steiner quadruple system of order __v__ (briefly an SQS(__v__)) is a pair (__X__,$\cal B$) with |__X__|β=β__v__ and $\cal B$ a set of quadruples taken from __X__ such that every triple in __X__ is in a unique quadruple in $\cal B$. Hanani [Canad J Math 12 (1960), 145β157] showed that
Large sets of Steiner systems s ( t , k , n ) exist for all finite t and k with t < k and all infinite n. The vector space analogues exist over a field F for all finite t and k with f < R provided that either v or F is infinite, and n 1 2k -t + 1. This inequality is best possible. o 1995 John Wiley
## Abstract In this article, we investigate a block sequence of a Steiner quadruple system which contains the blocks exactly once such that the collection of all blocks together with all unions of two consecutive blocks of the sequence forms an error correcting code with minimum distance four. In p