1-Overlap Cycles for Steiner Triple Systems

Details 1-Overlap Cycles for Steiner Triple Systems 1-Overlap Cycles for Steiner Triple Systems

2012-04-11

arxiv.org/abs/1204.2589v1

Mathematics

Combinatorics

17 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

1-Overlap Cycles for Steiner Triple Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 1-Overlap Cycles for Steiner Triple Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 1-Overlap Cycles for Steiner Triple Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311603