A resolvable Steiner triple systems of order \(v\), \(STS(v)\) for short, is resolvable if all its blocks can be partitioned into full parallel classes. A partial parallel class (PPC) of a \(STS(v)\) is a set of blocks that are vertex disjoint, but do not necessarily partition the point set. The paper considers \(STS(v)\) whose blocks can be partitioned into partial parallel classes (PPCs) in the uniform case, i.e., each PPC contains the same number \(m\) of blocks. When \(v \equiv 1, 3 \pmod 6\) this is equivalent to a Kirkman signal set \(KSS(v,m)\). Existence of \(KSS(v,m)\) were given by \textit{C. J. Colbourn} et al. [ibid. 65, No. 3, 199--212 (2012; Zbl 1254.05029)] for sufficiently large \(v\) and under some conditions on \(m\). Existence were also given for some small \(v\). In this paper the existence of \(KSS(4v-3, v-1)\) is assured for every \(v > 9\) such that \(v\equiv 3 \pmod 6\). Other new families of \(KSS(v,m)\) are given when \(v\) is a product of two arbitrary integers that are both congruent to \(3 \pmod 6\).
- A survey of Kirkman triple systems and related designs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Frames for Kirkman triple systems
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- Hanani triple systems
- scientific article; zbMATH DE number 1123805 (Why is no real title available?)
- scientific article; zbMATH DE number 898422 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- Trails of triples in partial triple systems
This page was built for publication: Some new Kirkman signal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671633)
