On the equivalence problem for succession rules

The notion of succession rule (system for short) provides a powerful tool for the enumeration of many classes of combinatorial objects. Often, different systems exist for a given class of combinatorial objects, and a number of problems arise naturally. An important one is the equivalence problem between two different systems. In this paper, we show how to solve this problem in the case of systems having a particular form. More precisely, using a bijective proof, we show that the classical system defining the sequence of Catalan numbers is equivalent to a system obtained by linear combinations of labels of the first one.

[1]  Andrea Frosini,et al.  A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function , 2001, Adv. Appl. Math..

[2]  Elena Barcucci,et al.  ECO method and hill-free generalized Motzkin paths , 2001 .

[3]  Mireille Bousquet-Mélou,et al.  Generating functions for generating trees , 2002, Discret. Math..

[4]  Elena Barcucci,et al.  Some combinatorial interpretations ofq-analogs of Schröder numbers , 1999 .

[5]  Fan Chung Graham,et al.  The Number of Baxter Permutations , 1978, J. Comb. Theory, Ser. A.

[6]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[7]  Alberto Del Lungo,et al.  ECO:a methodology for the enumeration of combinatorial objects , 1999 .

[8]  Luca Ferrari,et al.  Production matrices , 2005, Adv. Appl. Math..

[9]  Elena Barcucci,et al.  Some more properties of Catalan numbers , 1992, Discret. Math..

[10]  Alberto Del Lungo,et al.  Random Generation of Trees and Other Combinatorial Objects , 1999, Theor. Comput. Sci..

[11]  Enrica Duchi,et al.  ECO method and object grammars : two methods for the enumeration of combinatorial objects , 2003 .

[12]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[13]  Julian West,et al.  Generating trees and the Catalan and Schröder numbers , 1995, Discret. Math..

[14]  Renzo Pinzani,et al.  An algebraic characterization of the set of succession rules , 2002, Theor. Comput. Sci..

[15]  H. G. Forder,et al.  Some Problems in Combinatorics , 1961, The Mathematical Gazette.