Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti

DOI10.1016/S0304-3975(03)00220-2zbMath1048.05025OpenAlexW2085334526WikidataQ114121098 ScholiaQ114121098MaRDI QIDQ1885017

Cedric Chauve, Gilbert Labelle, Pierre Leroux, Michel Bousquet

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00220-2

zbMATH Keywords

EnumerationBijectionsRandom generationGood-Lagrange formulaMultisort speciesMultivariable power seriesTrees-like structures

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (3)

The mathematical life of Pierre Leroux ⋮ Counting trees using symmetries ⋮ Lagrange inversion and combinatorial species with uncountable color palette

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial proof of the multivariable Lagrange inversion formula
• Enumeration d'arbres et formules d'inversion de séries formelles
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• On elementary calculus and the Good formula
• Erratum to 'On elementary calculus and the Good formula'
• A short proof of the Lagrange-Good formula
• A bijective proof of infinite variated Good's inversion
• Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem
• Cacti, braids and complex polynomials
• A multivariate Lagrange inversion formula for asymptotic calculations
• Enumeration of \(m\)-ary cacti
• Incidence algebra antipodes and Lagrange inversion in one and several variables
• The Application of Lagrangian Methods to the Enumeration of Labelled Trees with Respect to Edge Partition
• The Generalisation of Tutte's Result for Chromatic Trees, by Lagrangian Methods
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• The β‐Extension of the Multivariable Lagrange Inversion Formula
• Another Enumeration of Trees

This page was built for publication: Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti