On the existence of nearly Kirkman triple systems with subsystems

It is proved in this paper that the necessary and sufficient conditions for the existence of an incomplete nearly Kirkman triple system INKTS(u, v) are u ≡ v ≡ 0 (mod 6), u ≥ 3v. As a consequence, we obtain a complete solution to the embedding problem for nearly Kirkman triple systems.      

Partitions of sets of two-fold triple systems,and their relation to some strongly regular graphs

LetX be a set ofv + 1 elements, wherev 0 or 1 (mod 3). If two copies of the collection of triples chosen fromX can be partitioned intov + 1 mutually disjoint two-fold triple systems, each based on a differentv-subset ofX, we say they form an overlarge set of two-fold triple systems, denoted byOS(TTS(v)). In this paper, we give the first construction of anOS(TTS(10)). We then investigate the properties of the uniqueOS(TTS(6)) and obtain:

The spectrum for large sets of pure directed triple systems

An LPDTS(ν) is a collection of 3(ν-2) disjoint pure directed triple systems on the same set ofνelements. It is showed in Tian's doctoral thesis that there exists an LPDTS(ν) forν=0,4 (mod 6),ν≥4. In this paper, we establish the existence of an LPDTS(ν) forν= 1,3 (mod 6),ν> 3. Thus the spectrum for LPDTS(ν) is completely determined to be the set {ν:ν= 0, 1 (mod 3),ν≥4}.     

有向Kirkman填充设计的谱

§ 1　IntroductionLet X be a set of v points.A packing(directed packing) of X is a collection of subsets(ordered subsets) of X(called blocks) such that any pair(ordered pair) of distinct pointsfrom X occur together in atmostone block in the collection.A packing(directed packing)is called resolvable ifitsblock setadmitsa partition into parallel classes,each parallel classbeing a partition of the pointset X.A Kirkman triple system KTS(v) is a collection Tof3 -subsets of X(triples) suchthat …     

The Spectrum of Tetrahedral Quadruple Systems

An ordered analogue of quadruple systems is tetrahedral quadruple systems. A tetrahedral quadruple system of order v and index λ, TQS(v, λ), is a pair (S, T){(S, \mathcal{T})} where S is a finite set of v elements and T{\mathcal{T}} is a family of oriented tetrahedrons of elements of S called blocks, such that every directed 3-cycle on S is contained in exactly λ blocks of T{\mathcal{T}} . When λ = 1, the spectrum problem of TQS(v, 1) has been completely determined. It is proved that a TQS(v, λ) exists if and only if λ(v − 1)(v − 2) ≡ 0 (mod 3), λv(v − 1)(v − 2) ≡ 0 (mod 4) and v ≥ 4.     

Further 6-sparse Steiner Triple Systems

We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently large v of the form 3p, p prime and p ≡ 3 (mod 4). We also give a complete list of all 429 6-sparse systems with v < 10000 produced by this construction.     

Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes

Let (v,u×c,λ)-splitting BIBD denote a (v,u×c,λ)-splitting balanced incomplete block design of order v with block size u×c and index λ. Necessary conditions for the existence of a (v,u×c,λ)-splitting BIBD are v≥uc, λ(v−1)≡0 (mod c(u−1)) and λ v(v−1)≡0 (mod (c ² u(u−1))). We show in this paper that the necessary conditions for the existence of a (v,3×3,λ)-splitting BIBD are also sufficient with possible exceptions when (1) (v,λ)∈{(55,1),(39,9k):k=1,2,…}, (2) λ≡0 (mod 54) and v≡0 (mod 2). We also show that there exists a (v,3×4,1)-splitting BIBD when v≡1 (mod 96). As its application, we obtain a new infinite class of optimal 4-splitting authentication codes.     

The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ > 1

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λ v(v − 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far from conclusive, especially for the case of λ = 1, which was given some attention in papers by Miao and Zhu [34], and subsequently by Abel et al. [1]. Here we investigate the situation for k = 6 and λ > 1. We find that the necessary conditions, namely v ≥ 6 and λ v(v − 1)≡0 (mod 6) are sufficient except for the known impossible cases v = 6 and either λ = 2 or λ odd. Researcher F.E. Bennett supported by NSERC Grant OGP 0005320.     

Further results on overlarge sets of Kirkman triple systems

In this paper, we introduce a new concept -- overlarge sets of generalized Kirkman systems （OLGKS）, research the relation between it and OLKTS, and obtain some new results for OLKTS. The main conclusion is： If there exist both an OLKF（6^k） and a 3-OLGKS（6^k-1,4） for all k ∈{6,7,...,40}／{8,17,21,22,25,26}, then there exists an OLKTS（v） for any v ≡ 3 （mod 6）, v ≠ 21. As well, we obtain the following result： There exists an OLKTS（6u ＋ 3） for u = 2^2n-1 - 1, 7^n, 31^n, 127^n, 4^r25^s, where n ≥ 1,r＋s≥ 1.     

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 the embeddings of mendelsohn triple systems

It is proved in this paper that there exists an incomplete Mendelsohn triple system IMTS(u,v; λ) if and only ifλ(u-v)(u-2v-1)≡0(mod 3),u≥2v+1 and (u, v, λ) ≠ (6, 1, 1). As a consequence, it is proved that for any given λ≥1, a Mendelsohn triple system MTS (v, λ) can be embedded in an MTS (u, λ) if and only ifλu(u-1)≡0(mod 3) andu≥2v+1. Project supported by the National Natural Science Foundation of China.     

Large sets with holes

We study large sets of disjoint Steiner triple systems “with holes”. The purpose of these structures is to extend the use of large sets of disjoint Steiner triple systems in the construction of various other large set type structures to values of v for which no Steiner triple system of order v exists, i.e., v ≡ 0, 2, 4, or 5 (mod 6). We give constructions for all of these congruence classes. We describe several applications, including applications to large sets of disjoint group divisible designs and to large sets of disjoint separable ordered designs. © 1993 John Wiley & Sons, Inc.     

Large sets of pure directed triple systems with index λ

A directed triple system of order v with index λ, briefly by DTS（v,λ）, is a pair （X, B） where X is a v-set and B is a collection of transitive triples （blocks） on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS（v, λ） is a DTS（v, λ） without repeated blocks. A simple DTS（v, ）,） is called pure and denoted by PDTS（v, λ） if （x, y, z） ∈ B implies （z, y, x）, （z, x, y）, （y, x, z）, （y, z, x）, （x, z, y） B. A large set of disjoint PDTS（v, λ）, denoted by LPDTS（v, λ）, is a collection of 3（v - 2）/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS（v, λ） are presented. Especially, we determine the spectrum of LPDTS（v, 2）.     

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.     

New results on large sets of Kirkman triple systems

The existence problem on the large sets of Kirkman triple systems (LKTS) was posed by Sylvester in 1850’s as an extension of Kirkman’s 15 schoolgirls problem. An LKTS(15) was constructed by Denniston in 1974. However, up to now the smallest unknown order for the existence of LKTS is still 21. In this paper we construct the two smallest unknown LKTS(v)s with v = 21 and v = 39 by using multiplier automorphism groups. Applying known recursive constructions, we show the existence of more infinite classes of large sets of Kirkman triple systems.     

The spectrum for overlarge sets of directed triple systems

A directed triple system of order v,denoted by DTS(v,λ),is a pair(X,B)where X is a v- set and B is a collection of transitive triples on X such that every ordered pair of X belongs toλtriples of B.An overlarge set of disjoint DTS(v,λ),denoted by OLDTS(v,λ),is a collection{(Y\{y},A_i)}_i, such that Y is a(v 1)-set,each(Y\{y},A_i)is a DTS(v,λ)and all A_i's form a partition of all transitive triples of Y.In this paper,we shall discuss the existence problem of OLDTS(v,λ)and give the following conclusion:there exists an OLDTS(v,λ)if and only if eitherλ=1 and v≡0,1(mod 3),orλ=3 and v≠2.     

The Existence of BIB Designs

Abstract Given any positive integers k≥ 3 and λ, let c(k, λ) denote the smallest integer such that v∈B(k, λ) for every integer v≥c(k, λ) that satisfies the congruences λv(v− 1) ≡ 0(mod k(k− 1)) and λ(v− 1) ≡ 0(mod k− 1). In this article we make an improvement on the bound of c(k, λ) provided by Chang in [4] and prove that . In particular, . Supported by NSFC Grant No. 19701002 and Huo Yingdong Foundation     

Some progress on the existence of 1-rotational Steiner triple systems

A Steiner triple system of order v (briefly STS(v)) is 1-rotational under G if it admits G as an automorphism group acting sharply transitively on all but one point. The spectrum of values of v for which there exists a 1-rotational STS(v) under a cyclic, an abelian, or a dicyclic group, has been established in Phelps and Rosa (Discrete Math 33:57–66, 1981), Buratti (J Combin Des 9:215–226, 2001) and Mishima (Discrete Math 308:2617–2619, 2008), respectively. Nevertheless, the spectrum of values of v for which there exists a 1-rotational STS(v) under an arbitrary group has not been completely determined yet. This paper is a considerable step forward to the solution of this problem. In fact, we leave as uncertain cases only those for which we have v =  (p ³−p)n +  1 ≡ 1 (mod 96) with p a prime, n \not o 0{n \not\equiv 0} (mod 4), and the odd part of (p ³ − p)n that is square-free and without prime factors congruent to 1 (mod 6).     

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.