论文信息 - Algebraic and Combinatorial Properties of Simple, Coloured Walks

Algebraic and Combinatorial Properties of Simple, Coloured Walks

We investigate the algebraic rules for functionally inverting a Riordan array given by means of two analytic functions. In this way, we find an extension of the Lagrange Inversion Formula and we apply it to some combinatorial problems on simple coloured walks. For some of these problems we give both an algebraic and a combinatorial proof.

[1] D. G. Rogers,et al. Pascal triangles, Catalan numbers and renewal arrays , 1978, Discret. Math..

[2] John Riordan,et al. Inverse Relations and Combinatorial Identities , 1964 .

[3] Louis W. Shapiro,et al. The Riordan group , 1991, Discret. Appl. Math..

[4] D. Knuth,et al. Mathematics for the Analysis of Algorithms , 1999 .

[5] Steven Roman. The Umbral Calculus , 1984 .

[6] G. Egorychev. Integral representation and the computation of combinatorial sums , 1984 .

[7] Renzo Sprugnoli,et al. Riordan arrays and combinatorial sums , 1994, Discret. Math..