Pith. sign in

REVIEW

Cyclic, Simple and Indecomposable Three-fold Triple Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1404.0528 v1 pith:VDBFIL3K submitted 2014-04-02 math.CO

classification math.CO
keywords cyclicindecomposablesimplesystemstripleprogramsequencesskolem-type
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools