Embeddings of Kirkman Systems KS(2,4,v)

A balanced incomplete block design(BIBD)B(κ,λ;ν)is a pair(X,A),whereX is a v-set of elements(called points)and A is a collection of k-subsets of X(called blocks)such that every unordered pair of points of X appears in exactlyλ blocks of A.A B(κ,1;ν)is called a Steiner system and denoted by S(2,κ,ν). A parallel class in a BIBD is a set of blocks that forms a partition of the     

The existence spectrum for overlarge sets of pure 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 exactly one triple of B.A DTS(v) (X,A) is called pure and denoted by PDTS(v) if (a,b,c) ∈ A implies (c,b,a) ∈/ A.An overlarge set of PDTS(v),denoted by OLPDTS(v),is a collection {(Y \{yi},Aij) : yi ∈ Y,j ∈ Z3},where Y is a (v+1)-set,each (Y \{yi},Aij) is a PDTS(v) and these Ais form a partition of all transitive triples on Y .In this paper,we shall discuss the existence problem of OLPDTS(v) and give the following conclusion: there exists an OLPDTS(v) if and only if v ≡ 0,1 (mod 3) and v 3.     

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.     

Existence of a-fold Perfect （v, {5, 8}, 1）-Mendelsohn Designs

Let v be a positive integer and let K be a set of positive integers. A （v, K, 1）-Mendelsohn design, which we denote briefly by （v, K, 1）-MD, is a pair （X, B） where X is a v-set （of points） and B is a collection of cyclically ordered subsets of X （called blocks） with sizes in the set K such that every ordered pair of points of X are consecutive in exactly one block of B. If for all t =1, 2,..., r, every ordered pair of points of X are t-apart in exactly one block of B, then the （v, K, 1）-MD is called an r-fold perfect design and denoted briefly by an r-fold perfect （v, K, 1）-MD. If K = {k） and r = k - 1, then an r-fold perfect （v, （k）, 1）-MD is essentially the more familiar （v, k, 1）-perfect Mendelsohn design, which is briefly denoted by （v, k, 1）-PMD. In this paper, we investigate the existence of 4-fold perfect （v, （5, 8}, 1）-Mendelsohn designs.     

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）.     

Embeddings of Pure Mendelsohn Triple Systems and Pure Directed Triple Systems

A λ-fold triple system of order v,denoted TS(v,λ),is a pair(V,A)where V is a v-set and A is a collection of 3-subsets(called triples)of V such that each 2-subset of V is contained in exactly λ triples.A triple system is called simple if itcontains no repeated triples. There are two related classes of triple systems,namely,Mendelsohn triple sys-tems and directed triple systems.     

The spectrum for overlarge sets of hybrid triple systems

A hybrid triple system of order v and index λ,denoted by HTS(v,λ),is a pair(X,B) where X is a v-set and B is a collection of cyclic triples and transitive triples on X,such that every ordered pair of X belongs to λ triples of B. An overlarge set of disjoint HTS(v,λ),denoted by OLHTS(v,λ),is a collection {(Y \{y},Ai)}i,such that Y is a(v+1)-set,each(Y \{y},Ai) is an HTS(v,λ) and all Ais form a partition of all cyclic triples and transitive triples on Y.In this paper,we shall discuss the existence problem of OLHTS(v,λ) and give the following conclusion: there exists an OLHTS(v,λ) if and only if λ=1,2,4,v ≡ 0,1(mod 3) and v≥4.     

On Indecomposable Triple Systems Without Repeated Blocks

A λ-fold triple system TS(ν,λ)is an ordered pair(V,B)where V is a setof v elements and B is a collection of 3-subsets(called blocks or triples)of Vsuch that each 2-subset of V is contained in exactly λ triples.A triple system iscalled simple if it contains no repeated triples.     

完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

Self-converse large sets of pure Mendelsohn triple systems

A Mendelsohn triple system of order v （MTS（v）） is a pair （X,B） where X is a v-set and 5g is a collection of cyclic triples on X such that every ordered pair of X belongs to exactly one triple of B. An MTS（v） （X,B） is called pure and denoted by PMTS（v） if （x, y, z） ∈ B implies （z, y, x） ∈B. A large set of MTS（v）s （LMTS（v）） is a collection of v - 2 pairwise disjoint MTS（v）s on a v-set. A self-converse large set of PMTS（v）s, denoted by LPMTS＊ （v）, is an LMTS（v） containing [ v-2/2] converse pairs of PMTS（v）s. In this paper, some results about the existence and non-existence for LPMTS＊ （v） are obtained.     

Kirkman Packing Designs KPD ({3, 5*},v)

A Kirkman packing design KPD ({3, 5^*},v) is a resolvable packing with maximum possible number of parallel classes, each class containing one block of size 5 and all other blocks of size three. Such designs can be used to construct certain threshold schemes in cryptography. In this paper, direct and recursive constructions are discussed for such designs. The existence of a KPD ({3, 5^*},v) for is established with a few possible exceptions.     

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.      

Kirkman packing and covering designs with spanned holes of size 2

A Kirkman holey packing (resp. covering) design, denoted by KHPD(g^u) (resp. KHCD(g^u)), is a resolvable (gu, 3, 1) packing (resp. covering) design of pairs with u disjoint holes of size g, which has the maximum (resp. minimum) possible number of parallel classes. Each parallel class contains one block of size δ, while other blocks have size 3. Here δ is equal to 2, 3, and 4 when gu ≡ 2, 3, and 4 (mod 3) in turn. In this paper, the existence problem of a KHPD(2^u) and a KHCD(2^u) is solved with one possible exception of a KHPD(2⁸). © 2004 Wiley Periodicals, Inc.     

Hanani triple systems

Hanani triple systems onv≡1 (mod 6) elements are Steiner triple systems having (v−1)/2 pairwise disjoint almost parallel classes (sets of pairwise disjoint triples that spanv−1 elements), and the remaining triples form a partial parallel class. Hanani triple systems are one natural analogue of the Kirkman triple systems onv≡3 (mod 6) elements, which form the solution of the celebrated Kirkman schoolgirl problem. We prove that a Hanani triple system exists for allv≡1 (mod 6) except forv ∈ {7, 13}.     

The existence of doubly near resolvable (v,3,2)-BIBDs

The existence of doubly near resolvable (v,2,1)-BIBDs was established by Mullin and Wallis in 1975. In this article, we determine the spectrum of a second class of doubly near resolvable balanced incomplete block designs. We prove the existence of DNR(v,3,2)-BIBDs for v ≡ 1 (mod 3), v ≥ 10 and v ? {34,70,85,88,115,124,133,142}. The main construction is a frame construction, and similar constructions can be used to prove the existence of doubly resolvable (v,3,2)-BIBDs and a class of Kirkman squares with block size 3, KS₃(v,2,4). © 1994 John Wiley & Sons, Inc.     

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.     

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.     

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.     

Some infinite families of large sets of Kirkman triple systems

A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection {(X, B_i) : 1 ≤ i ≤ v ? 2}, where every (X,B_i) is a KTS(v) and all B_i form a partition of all triples on X. Many researchers have studied the existence of LKTS(v) for a long time. In [13], the author introduced a concept—large set of generalized Kirkman systems (LGKS), which plays an important role in the discussion of LKTS. In this article, we give a new construction for LGKS and obtain some new results of LKTS, that is, there exists an LKTS(6u + 3) for u = qⁿ, where n ≥ 1, q ≡ 7 (mod 12) and q is a prime power. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 202–212, 2008     

Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups

We show that if G is a finite Abelian group and the block size is 3, then the necessary conditions for the existence of a (v,3,λ;G) GBRD are sufficient. These necessary conditions include the usual necessary conditions for the existence of the associated (v,3,λ) BIBD plus λ≡ 0 (mod|G|), plus some extra conditions when |G| is even, namely that the number of blocks be divisible by 4 and, if v = 3 and the Sylow 2-subgroup of G is cyclic, then also λ≡ 0 (mod2|G|).