✦ LIBER ✦

Partitions of sets of designs on seven, eight and nine points

✍ Scribed by Rudolf Mathon; Anne Penfold Street

Book ID: 104340252
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 842 KB
Volume: 58
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(96)00066-3

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the sets of all possible Steiner triple systems (STS) which can be defined on a 7-set or an 8-set, the sets of all possible Steiner quadruple systems (SQS) which can be defined on an 8-set or a 9-set, and the set of all possible Steiner triple systems, on 9 points each, which can be defined on a 9-set.

By considering the large and overlarge sets of these designs, we derive various strongly regular graphs and balanced or partially balanced designs. We show connections between the overlarge sets of SQS(8), the STS(9) and the resolutions of the set of all (9) triples chosen from a 9-set into 28 parallel classes of three pairwise disjoint triples, with no two parallel classes orthogonal.

Finally we show that the set of all 840 distinct STS(9)'s which can be defined on a given 9-set can be partitioned into 120 large sets of STS(9).

📜 SIMILAR VOLUMES

Transversal Designs of Block Size Eight

Transversal Designs of Block Size Eight and Nine

✍ Charles J Colbourn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 323 KB

On Minimal Defining Sets of Full Designs

On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets oft-Designs

✍ Emre Kolotoğlu; Emine Şule Yazıcı 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 269 KB

Partitions of a Polytope and Mappings of

Partitions of a Polytope and Mappings of a Point Set to Facets

✍ Roman N. Karasev 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 256 KB

On support points and support functional

On support points and support functionals of convex sets

✍ C. De Bernardi; L. Veselý 📂 Article 📅 2009 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 183 KB

On splitting sets in block designs and f

On splitting sets in block designs and finding roots of polynomials

✍ P.C. Van Oorschot; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to pr

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi