Name
Abstract | ||
|---|---|---|
Starting from a succession rule for Catalan numbers, we define a procedure for encoding and listing the objects enumerated by these numbers such that two consecutive codes of the list differ only by one digit. The Gray code we obtain can be generalized to all the succession rules with the stability property: each label (k) has in its productions two labels c 1 and c 2, always in the same position, regardless of k. Because of this link, we define Gray structures as 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, such as the finite, factorial or transcendental ones. We also indicate an algorithm which is a very slight modification of Walsh’s one, working in O(1) worst-case time per word for generating Gray codes. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00236-007-0053-0 | Acta Inf. |
Keywords | Field | DocType |
worst-case time,combinatorial object,slight modification,catalan number,succession rule,stability property,various succession rule,gray structure,gray code,general exhaustive generation algorithm,consecutive code,generic algorithm | Discrete mathematics,Combinatorics,Lien,Catalan number,Algorithm,Factorial,Gray code,Transcendental number,Mathematics,Numerical stability,Encoding (memory),Gray (unit) | Journal |
Volume | Issue | ISSN |
44 | 5 | 1432-0525 |
Citations | PageRank | References |
7 | 0.58 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Bernini | 1 | 34 | 7.68 |
| Elisabetta Grazzini | 2 | 44 | 17.57 |
| Elisa Pergola | 3 | 149 | 18.60 |
| Renzo Pinzani | 4 | 341 | 67.45 |