A general exhaustive generation algorithm for Gray structures

Details A general exhaustive generation algorithm for Gray structures A general exhaustive generation algorithm for Gray structures

2007-03-09

arxiv.org/abs/math/0703262v1

Mathematics

Combinatorics

21 pages, 3 figures

Scientific paper

Starting from a succession rule for Catalan numbers, we define a procedure encoding and listing the objects enumerated by these numbers such that two consecutive codes of the list differ only for one digit. Gray code we obtain can be generalized to all the succession rules with the stability property: each label $(k)$ has in its production two labels $c_1$ and $c_2$, always in the same position, regardless of $k$. Because of this link, we define Gray structures the sets of those combinatorial objects whose construction can be encoded by a succession rule with the stability property. This property is a characteristic that can be found among various succession rules, as the finite, factorial or transcendental ones. We also indicate an algorithm which is a very slight modification of the Walsh's one, working in a O(1) worst-case time per word for generating Gray codes.

Affiliated with

Also associated with

No associations

Rating

A general exhaustive generation algorithm for Gray structures 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 A general exhaustive generation algorithm for Gray structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A general exhaustive generation algorithm for Gray structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693668