Skip to main content
SpringerLink
Log in

Algebraic and combinatorial properties of simple, coloured walks

  • Contributed Papers
  • Conference paper
  • First Online:
Trees in Algebra and Programming — CAAP'94 (CAAP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 787))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bicknell, V. E. Hoggatt: Unit determinants in generalized Pascal triangles, Fibonacci Quarterly, 11 (Apr. 1973), 131–144.

    Google Scholar 

  2. L. Carlitz: Generalized Stirling and related numbers, Rivista di Matematica della Università di Parma, serie 4, 4, 79–99, 1978.

    Google Scholar 

  3. L. Comtet: Advanced Combinatorics, Reidel, Dordrecht, 1974.

    Google Scholar 

  4. G.P. Egorychev: Integral representation and the computation of combinatorial sums, Translations of mathematical monographs 59, American Mathematical Society, 1984.

    Google Scholar 

  5. D.H. Greene, D.E. Knuth: Mathematics for the Analysis of Algorithms, Birkäuser, 1982.

    Google Scholar 

  6. V. E. Hoggatt, M. Bicknell-Johnson: Numerator polynomial coefficient arrays for Catalan and related sequence convolution triangles, Fibonacci Quarterly, 15 (Feb. 1977), 30–34.

    Google Scholar 

  7. E. Jabotinsky, Sur la représentation de la composition de fonctions par un produit de matrices. Application à l'itération de e x et de e x-1, Comptes Rendus Hebdomadaires des Sciences de L'Academie des Sciences, 224, 323–324, 1947.

    Google Scholar 

  8. E. Jabotinsky, Representation of functions by matrices. Application to Faber polynomials, Proceedings of the American Mathematical Society, 4, 546–553, 1953.

    Google Scholar 

  9. D. E. Knuth, Convolution polynomial, The Mathematica Journal, 2, 4, 67–78, 1992.

    Google Scholar 

  10. J. Riordan: Combinatorial identities, Wiley, New York, 1968.

    Google Scholar 

  11. D. G. Rogers, Pascal Triangles: Catalan numbers and renewal arrays, Discrete Mathematics, 22, 301–310, 1978.

    Article  Google Scholar 

  12. S. Roman: The Umbral Calculus, Academic Press, Orlando, 1978.

    Google Scholar 

  13. S. Roman, G. C. Rota: The umbral calculus, Advances in Mathematics, 27, 95–188, 1978.

    Article  Google Scholar 

  14. L.V. Shapiro: Private Communication.

    Google Scholar 

  15. L.V. Shapiro, S. Getu, W.-J. Woan, L. Woodson: The Riordan group. Discrete Applied Mathematics, 34, 229–239, 1991.

    Article  Google Scholar 

  16. R. Sprugnoli, Riordan arrays and combinatorial sums, to appear in Discrete Mathematics.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Via Lombroso 6/17, Firenze, Italy

    Donatella Merlini, Renzo Sprugnoli & M. Cecilia Verri

Authors
  1. Donatella Merlini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Renzo Sprugnoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Cecilia Verri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merlini, D., Sprugnoli, R., Verri, M.C. (1994). Algebraic and combinatorial properties of simple, coloured walks. In: Tison, S. (eds) Trees in Algebra and Programming — CAAP'94. CAAP 1994. Lecture Notes in Computer Science, vol 787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017484

Download citation

  • DOI: https://doi.org/10.1007/BFb0017484

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57879-6

  • Online ISBN: 978-3-540-48373-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation