1-overlap cycles for Steiner triple systems

DOI10.1007/S10623-013-9802-YzbMATH Open1321.94135arXiv1204.2589OpenAlexW2042340771MaRDI QIDQ2249792FDOQ2249792

Authors: Victoria Horan, Glenn H. Hurlbert 

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: A number of applications of Steiner triple systems (e.g. disk erasure codes) exist that require a special ordering of its blocks. Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, and Gray codes are examples of listing elements of a combinatorial family in a specific manner, and Godbole invented the following generalization of these in 2010. 1-overlap cycles require a set of strings to be ordered so that the last letter of one string is the first letter of the next. In this paper, we prove the existence of 1-overlap cycles for automorphism free Steiner triple systems of each possible order. Since Steiner triple systems have the property that each block can be represented uniquely by a pair of points, these 1-overlap cycles can be compressed by omitting non-overlap points to produce rank two universal cycles on such designs, expanding on the results of Dewar.

Full work available at URL: https://arxiv.org/abs/1204.2589

Recommendations

• Overlap cycles for Steiner quadruple systems
• Trails of triples in partial triple systems
• Universal cycles for weak orders
• Publication:4508366
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.

zbMATH Keywords

universal cyclesGray codesoverlap cycles

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Cites Work

• Title not available (Why is that?)
• Universal cycles for combinatorial structures
• On \(\alpha\)-overlap graphs
• 2-\((v,k,\lambda)\) designs of small order
• Some Remarks on the Triple Systems of Steiner.
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Research problems on Gray codes and universal cycles
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• A catalogue of the Steiner triple systems of order 19
• Title not available (Why is that?)
• On the existence of automorphism free Steiner triple systems
• Overlap cycles for Steiner quadruple systems

Cited In (8)

• Quasi-Eulerian hypergraphs
• Overlap cycles for Steiner quadruple systems
• Covering hypergraphs are Eulerian
• Triple systems are Eulerian
• \(s\)-overlap cycles for permutations
• Euler tours in hypergraphs
• A Dual-Radix Approach to Steiner’s 1-Cycle Theorem
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences

This page was built for publication: 1-overlap cycles for Steiner triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249792)