Cyclic, simple, and indecomposable three-fold triple systems
From MaRDI portal
Publication:5740797
zbMATH Open1343.05040arXiv1404.0528MaRDI QIDQ5740797FDOQ5740797
Authors: Nabil Shalaby, Bradley Sheppard, Daniela Silvesan 
Publication date: 20 July 2016
Abstract: In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences, three-fold triple systems having the properties of being cyclic, simple, and indecomposable for all admissible orders v, with some possible exceptions for v = 9 and v = 24c + 57, where c >1 is a constant. To prove the simplicity we used a Mathematica computer program. We list in the Appendix the code and the results of the program.
Full work available at URL: https://arxiv.org/abs/1404.0528
Recommendations
- Simple and indecomposable twofold cyclic triple systems from Skolem sequences
- Cyclically indecomposable triple systems that are decomposable
- On decomposability of simple cyclic triple systems
- Cyclically indecomposable cyclic \(\lambda\)-fold triple systems that are decomposable for \(\lambda=2,3,4\)
- Indecomposable triple systems exist for all lambda
Cited In (10)
- On decomposability of simple cyclic triple systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some large sets of cyclic triple systems
- The number of triple systems without even cycles
- Cyclically indecomposable triple systems that are decomposable
- An enumeration on the structure of nonrepeated triples in a three-fold triple system
- Simple and indecomposable twofold cyclic triple systems from Skolem sequences
- Cyclic block designs with block size 3 from Skolem-type sequences
This page was built for publication: Cyclic, simple, and indecomposable three-fold triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740797)
