In this article, it is shown that the necessary conditions for the existence of a holey Steiner pentagon system (HSPS) of type h n are also sufficient, except possibly for the following cases: (1) when n = 15, and h ≡ 1 or 5 (mod 6) where h ≡ 0 (mod 5), or h = 9; and (2) (h, n) ∈ {(6, 6), (6, 36), (
Super-simple holey Steiner pentagon systems and related designs
✍ Scribed by R. Julian R. Abel; Frank E. Bennett; Gennian Ge
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 256 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A Steiner pentagon system of order v (SPS(v)) is said to be super‐simple if its underlying (v, 5, 2)‐BIBD is super‐simple; that is, any two blocks of the BIBD intersect in at most two points. It is well known that the existence of a holey Steiner pentagon system (HSPS) of type T implies the existence of a (5, 2)‐GDD of type T. We shall call an HSPS of type T super‐simple if its underlying (5, 2)‐GDD of type T is super‐simple; that is, any two blocks of the GDD intersect in at most two points. The existence of HSPSs of uniform type h^n^ has previously been investigated by the authors and others. In this article, we focus our attention on the existence of super‐simple HSPSs of uniform type h^n^. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 301–328, 2008
📜 SIMILAR VOLUMES