Algebraic and combinatorial properties of simple, coloured walks

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 22 Nov 2005 English Publisher:Springer Science and Business Media LLC

Authors: Donatella Merlini; Renzo Sprugnoli; M. Cecilia Verri;

doi: 10.1007/bfb0017484

Algebraic and combinatorial properties of simple, coloured walks

- Summary
- Metrics

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.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

7

Average

Top 10%

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now