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
Classification of Flag-Transitive Steiner Quadruple Systems
β Scribed by Michael Huber
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 126 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
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 classifying all flag-transitive 3&(v, k, 1) designs'' for the smallest value of k. Moreover, a generalization of a result of H. Lu neburg (1965, Math. Z. 89, 82 90) is achieved.
π SIMILAR VOLUMES
## 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
## 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
The flag-transitive affine planes of order 125 are completely classified. There are five such planes.
We describe an algorithm that was used to classify completely all Steiner systems S(2,4,25). The result is that in addition to the 16 nonisomorphic designs with nontrivial automorphism group already known, there are precisely two such nonisomorphic designs with a trivial automorphism group.