AbstractMotivated by constructing cyclic simple designs, we consider how to decomposing all the triples of Zv into cyclic triple systems. Furthermore, we define a large set of cyclic triple systems to be a decomposition of triples of Zv into indecomposable cyclic designs. Constructions of decompositions and large sets are given. Some infinite classes of decompositions and large sets are obtained. Large sets of small v with odd v<97 are also given. As an application, the results are used to construct cyclic simple triple systems
AbstractA triple system (v, 3, λ) is indecomposable if it is not the union of two triple systems (v,...
AbstractIn this paper we give some recursive constructions for strictly cyclic 3-designs. Using thes...
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...
AbstractMotivated by constructing cyclic simple designs, we consider how to decomposing all the trip...
This thesis concerns the automorphism groups of Steiner triple systems and of cycle systems. Althoug...
AbstractA general construction of 2 − (v, 3, 2) designs (twofold triple systems) is used to produce ...
AbstractWe develop some powerful techniques by which (certain classes of) combinatorial designs with...
AbstractA triple system is a balanced incomplete block design D(v, k, λ, b, r) with k = 3. Although ...
AbstractWe present an orderly algorithm for classifying triple systems. Subsequently, we show that t...
We prove that the necessary conditions for the existence of cyclic block designs with block size 3 a...
AbstractTriplewhist tournaments are a specialization of whist tournament designs. The spectrum for t...
AbstractEvery twofold triple system, or block design with k = 3 and λ = 2, is the underlying design ...
AbstractWe continue our study of partitions of the set of all (v3) triples chosen from a v-set into ...
AbstractIn 2001, Ge and Zhu published a frame construction which they utilized to construct a large ...
AbstractDirect, easy, and self-contained proofs are presented of the existence of triple systems wit...
AbstractA triple system (v, 3, λ) is indecomposable if it is not the union of two triple systems (v,...
AbstractIn this paper we give some recursive constructions for strictly cyclic 3-designs. Using thes...
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...
AbstractMotivated by constructing cyclic simple designs, we consider how to decomposing all the trip...
This thesis concerns the automorphism groups of Steiner triple systems and of cycle systems. Althoug...
AbstractA general construction of 2 − (v, 3, 2) designs (twofold triple systems) is used to produce ...
AbstractWe develop some powerful techniques by which (certain classes of) combinatorial designs with...
AbstractA triple system is a balanced incomplete block design D(v, k, λ, b, r) with k = 3. Although ...
AbstractWe present an orderly algorithm for classifying triple systems. Subsequently, we show that t...
We prove that the necessary conditions for the existence of cyclic block designs with block size 3 a...
AbstractTriplewhist tournaments are a specialization of whist tournament designs. The spectrum for t...
AbstractEvery twofold triple system, or block design with k = 3 and λ = 2, is the underlying design ...
AbstractWe continue our study of partitions of the set of all (v3) triples chosen from a v-set into ...
AbstractIn 2001, Ge and Zhu published a frame construction which they utilized to construct a large ...
AbstractDirect, easy, and self-contained proofs are presented of the existence of triple systems wit...
AbstractA triple system (v, 3, λ) is indecomposable if it is not the union of two triple systems (v,...
AbstractIn this paper we give some recursive constructions for strictly cyclic 3-designs. Using thes...
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...