On large sets of disjoint steiner triple systems,VI

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, we prove that D(v) = v ? 2 holds for all v ≡ 1, 3 (mod 6) (v>7), except possibly v = 141, 283, 501, 789, 1501, 2365.     

On large sets of disjoint steiner triple systems I

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, it is proved that if D(2 + n) = n, p is a prime number, p ≡ 7 (mod 8) or p? {5, 17, 19, 2}, and (p, n) ≠ (5, 1), then D(2 + pn) = pn.     

On large sets of disjoint Kirkman triple systems

In this paper, we introduce LR(u) designs and use these designs together with large sets of Kirkman triple systems (LKTS) and transitive KTS (TKTS) of order v to construct an LKTS(uv). Our main result is that there exists an LKTS(v) for v∈{3nm(2·13k+1)t;n?1,k?1,t=0,1,m∈{1,5,11,17,25,35,43}}.     

On large sets of disjoint Steiner triple systems II

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, we prove that if n is an odd number, there exist 12 mutually orthogonal Latin squares of order n and D(1 + 2n) = 2n ? 1, then D(1 + 12n) = 12n ? 1.     

A construction of disjoint steiner triple systems

A set of n ? 2 disjoint Steiner triple systems on n objects is constructed whenever n has the property that the order of 2 modulo n ? 2 is an odd number.     

Disjoint finite partial steiner triple systems can be embedded in disjoint finite steiner triple systems

This paper shows that a pair of disjoint finite partial Steiner triple systems can be embedded in a pair of disjoint finite Steiner triple systems.     

A construction for large sets of disjoint Kirkman triple systems

A Steiner system S(t, k, v) is called i-resolvable, 0 < i < t, if its block set can be partitioned into S(i, k, v). In this paper, a 2-resolvable S(3, 4, v) is used to construct a large set of disjoint Kirkman triple systems of order 3v − 3 (briefly LKTS) and some new orders for LKTS are then obtained. Research supported by Tianyuan Mathematics Foundation of NSFC Grant 10526032 and Natural Science Foundation of Universities of Jiangsu Province Grant 05KJB110111.     

On sets of pairwise disjoint blocks in Steiner triple systems

In a Steiner triple system with 19 points, each disjoint pair blocks is contained in at least 43 quadruplets of pairwise disjoint blocks. In a Steiner triple system with 25 points, each disjoint pair of blocks is contained in a pairwise disjoint quintuple of blocks. Theorems used are those of Connor on determinants based on intersecting and nonintersecting blocks of a BIBD, and of Turán on extremal graphs without triangles.     

A theorem on the maximum number of disjoint steiner triple systems

We prove that D(2v + 1) ? v + 1 + D(v) for v > 3 where D(v) denotes the maximum number of pairwise disjoint Steiner triple systems of order v. Since D(v) ? v ? 2 it follows that for v > 3, D(2v + 1) = 2v ?1 whenever D(v) = v ? 2.     

A new existence proof for large sets of disjoint Steiner triple systems

A Steiner triple system of order v (briefly STS(v)) consists of a v-element set X and a collection of 3-element subsets of X, called blocks, such that every pair of distinct points in X is contained in a unique block. A large set of disjoint STS(v) (briefly LSTS(v)) is a partition of all 3-subsets (triples) of X into v-2 STS(v). In 1983–1984, Lu Jiaxi first proved that there exists an LSTS(v) for any v≡1 or with six possible exceptions and a definite exception v=7. In 1989, Teirlinck solved the existence of LSTS(v) for the remaining six orders. Since their proof is very complicated, it is much desired to find a simple proof. For this purpose, we give a new proof which is mainly based on the 3-wise balanced designs and partitionable candelabra systems.     

A completion of the spectrum for large sets of disjoint transitive triple systems

In this paper, we give a recursive construction from an LTTS(v + 2) to an LTTS(16v + 2) for v 3. Furthermore, the existence of LTTS(2ⁿ + 2) is proved. Thereby, we completely solve the existence problem of LTTS)(v) (large set of pairwise disjoint transitive triple systems of order v).     

Some mutually disjoint steiner systems

A t-design λ; t-d-n is a system of subsets of size d (called blocks) from an n-set S, such that each t-subset from S is contained in precisely λ blocks. A Steiner system S(l, m, n) is a t-design with parameters 1; l-m-n. Two Steiner systems (or t-designs) are disjoint if they share no blocks. A search has been conducted which resulted in discovering 9 mutually disjoint S(5, 8, 24)'s, 24 mutually disjoint S(4, 7, 23)'s, 60 mutually disjoint S(3, 6, 22)'s, and 197 mutually disjoint S(2, 5, 21)'s. Taking unions of several mutually disjoint Steiner systems will then produce t-designs (with varying λ's) on 21, 22, 23, and 24 points.     

On disjoint partial triple systems

In this paper we construct allDMB PTSs (i.e. disjoint and mutually balanced partial triple systems) havingm=9 blocks.     

The spectrum for large sets of disjoint mendelsohn triple systems with any index

The spectrum for LMTS(v,1) has been obtained by Kang and Lei (Bulletin of the ICA, 1993). In this article, firstly, we give the spectrum for LMTS(v,3). Furthermore, by the existence of LMTS(v,1) and LMTS(v,3), the spectrum for LMTS(v,λ) is completed, that is v ≡ 2 (mod λ), v ≥ λ + 2, if λ ? 0(mod 3) then v ? 2 (mod 3) and if λ = 1 then v ≠ 6. © 1994 John Wiley & Sons, Inc.     

Note on large sets of infinite steiner systems

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 t < k provided that either v or F is infinite, and n ? 2k ? t + 1. This inequality is best possible. © 1995 John Wiley & Sons, Inc.     

On the number of steiner triple systems

We obtain a new lower estimate for the number N(n) of nonisomorphic Steiner triple systems of order n: $$N(n) \geqslant n^{\frac{{n^2 }}{{12}} - O\left( {\frac{{n^2 }}{{logn}}} \right)} .$$ This makes it possible to show that log N(n) is of order n² log n.     

Anti-mitre steiner triple systems

A mitre in a Steiner triple system is a set of five triples on seven points, in which two are disjoint. Recursive constructions for Steiner triple systems containing no mitre are developed, leading to such anti-mitre systems for at least 9/16 of the admissible orders. Computational results for small cyclic Steiner triple systems are also included.     

Skew-orthogonal steiner triple systems

Two Steiner triple systems, S₁=(V,ℬ︁₁) and S₂=(V,ℬ︁₂), are orthogonal (S₁ ⟂ S₂) if ℬ︁₁ ∩ ℬ︁₂=∅︁ and if {u,ν} ≠ {x,y}, uνw,xyw ∈ ℬ︁₁, uνs, xyt ∈ ℬ︁₂ then s ≠ t. The solution to the existence problem for orthogonal Steiner triple systems, (OSTS) was a major accomplishment in design theory. Two orthogonal triple systems are skew-orthogonal (SOSTS, written S₁∼S₂) if, in addition, we require uνw, xys ∈ ℬ︁₁ and uνt, xyw∈ ℬ︁₂ implies s ≠ t. Orthogonal triple systems are associated with a class of Room squares, with the skew orthogonal triple systems corresponding to skew Room squares. Also, SOSTS are related to separable weakly union-free TTS. SOSTS are much rarer than OSTS; for example SOSTS(ν) do not exist for ν=3,9,15. Furthermore, a fundamental construction for the earlier OSTS proofs when ν ≡ 3 (mod 6) cannot exist. In the case ν≡ 1 ( mod 6) we are able to show existence except possibly for 22 values, the largest of which is 1315. There are at least two non-isomorphic OSTS(19)s one of which is SOSTS(19) and the other not. A SOSTS(27) was found, implying the existence of SOSTS(ν) for ν ≡ 3 (mod 6) with finitely many possible exceptions.