Universal Cycles for Weak Orders

Details Universal Cycles for Weak Orders Universal Cycles for Weak Orders

2012-03-23

arxiv.org/abs/1203.5169v3

Mathematics

Combinatorics

12 pages; added contact information for authors; revised Section 4

Scientific paper

Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutive words, is s-overlap cycles, which relax such a constraint. In this paper we study weak orders, which are relations that are transitive and complete. We prove the existence of universal and s-overlap cycles for weak orders, as well as for fixed height and/or weight weak orders, and apply the results to cycles for ordered partitions as well.

Affiliated with

Also associated with

No associations

Rating

Universal Cycles for Weak Orders 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 Universal Cycles for Weak Orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Cycles for Weak Orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471638