Affine-invariant strictly cyclic Steiner quadruple systems
Let \(t\), \(v\), \(k\), \(\lambda\) be positive integers satisfying \(v > k> t\). A \(t\)-\((v,k,\lambda)\) design is an ordered pair \((V, {\mathcal B})\), where \(V\) is a finite set of \(v\) points, \(\mathcal B\) is a collection of \(k\)-subsets of \(V\), called blocks, such that every \(t\)-subset of \(V\) occurs in exactly \(\lambda\) blocks in \(\mathcal B\). A \(3\text{-}(v,4,1)\) design is called a Steiner quadruple system and denoted by \(\operatorname{SQS}(v)\). \(\operatorname{SQS}(v)\) exist if and only if \(v\equiv 2,4 \pmod{6}\). An automorphism group \(G\) of a \(t\)-design \((V,{\mathcal B})\) is a permutation group defined on \(V\) which leaves the blocks, \(\mathcal B\), invariant. A \(t\text{-}(v,k,\lambda)\)-design is called cyclic if it admits a cyclic group \(Z_v\) as its automorphism group. It is called strictly cyclic if all the cyclic orbits are full. In this paper, the authors investigate the existence of strictly cyclic SQS which are invariant under the affine group, AsSQS. In general, the number of affine orbits is much less than that of cyclic orbits and this is useful in applications. For a prime \(p\equiv 1 \pmod{4}\), the authors describe a direct construction for \(\operatorname{AsSQS}(2p)\) which requires the existence of a 1-factor of a graph defined by the generators of the projective special linear group \(\operatorname{PSL}(2,p)\). A second direct construction for an \(\operatorname{AsSQS}(2p)\) which is 2-chromatic uses a rainbow 1-factor of a specific hypergraph. They also provide recursive constructions which produce \(\operatorname{AsSQS}(2p^m)\) for \(m\) a positive integer. They use their constructions and computer searches to show that \(\operatorname{AsSQS}(2p^m)\) exist for every prime \(p\equiv 1 \pmod{4}\) with \( p < 10^5\) and any positive integer \(m\). The authors include comments on both their algorithms and on applications of the designs in optical orthogonal codes.
- 2-chromatic Steiner quadruple systems
- A brief review on Egmont Köhler's mathematical work
- A construction for 2-chromatic Steiner quadruple systems
- A number theoretic conjecture and the existence of \(S\)-cyclic Steiner quadruple systems
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Authentication codes and combinatorial designs.
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with =2
- Cross ratios and projectivities of the line
- Cyclic Steiner quadruple systems and Köhler's orbit graphs
- Design invariants
- Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry
- Factors and factorizations of graphs. Proof techniques in factor theory
- Graph Factors and Matching Extensions
- scientific article; zbMATH DE number 4044605 (Why is no real title available?)
- scientific article; zbMATH DE number 3781184 (Why is no real title available?)
- scientific article; zbMATH DE number 124518 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- Infinite families of strictly cyclic Steiner quadruple systems
- k-difference-cycles and the construction of cyclic t-designs
- On affine-invariant two-fold quadruple systems
- On Quadruple Systems
- On the existence of cyclic Steiner quadruple systems SQS(2p)
- One factors and the existence of affine designs
- Optical orthogonal codes: Their bounds and new optimal constructions
- Optimal \((n,4,2)\)-OOC of small orders.
- Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time
- Piotrowski's infinite series of Steiner quadruple systems revisited
- Remarks on regular factors of regular graphs
- Research problems
- Some constructions and bounds for authentication codes
- Some Recent Results on Cyclic Steiner Quadruple Systems - A Survey
- Some remarks on the construction of cyclic Steiner quadruple systems
- Some results on cyclic codes which are invariant under the affine group and their applications
- Steiner quadruple systems - a survey
- The application of difference sets to the design of a balanced multiple-valued filing scheme
- The general maximum matching algorithm of Micali and Vazirani
- Zyklische Quadrupelsysteme
- Some remarks on the construction of cyclic Steiner quadruple systems
- Triple systems in \(\text{PG}(2,q)\)
- On the existence of cyclic Steiner quadruple systems SQS(2p)
- Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes
- Infinite families of strictly cyclic Steiner quadruple systems
- Symmetric abelian group-invariant Steiner quadruple systems
- Egalitarian Steiner quadruple systems of doubly even order
- Egalitarian Steiner triple systems for data popularity
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
- scientific article; zbMATH DE number 6699957 (Why is no real title available?)
- scientific article; zbMATH DE number 426158 (Why is no real title available?)
- Classification of cyclic Steiner quadruple systems
- Overlap cycles for Steiner quadruple systems
- One factors and the existence of affine designs
- On affine-invariant two-fold quadruple systems
This page was built for publication: Affine-invariant strictly cyclic Steiner quadruple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517265)
