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-2MaRDI QIDQ1885017zbMATH OpenOpenAlexWikidataFDO

Authors Michel Bousquet, Cedric Chauve, Gilbert Labelle, Pierre Leroux

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)

Recommendations

• scientific article; zbMATH DE number 1552328
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• Counting trees using symmetries
• Lagrange inversion and combinatorial species with uncountable color palette
• Multivariate Lagrange inversion formula and the cycle lemma

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1552328 (Why is no real title available?)
• scientific article; zbMATH DE number 3219337 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• A bijective proof of infinite variated Good's inversion
• A combinatorial proof of the multivariable Lagrange inversion formula
• A multivariate Lagrange inversion formula for asymptotic calculations
• A short proof of the Lagrange-Good formula
• Another Enumeration of Trees
• Cacti, braids and complex polynomials
• Enumeration d'arbres et formules d'inversion de séries formelles
• Enumeration of \(m\)-ary cacti
• Erratum to 'On elementary calculus and the Good formula'
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Incidence algebra antipodes and Lagrange inversion in one and several variables
• Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem
• On elementary calculus and the Good formula
• Some results concerning plane cacti.
• 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
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• The β‐Extension of the Multivariable Lagrange Inversion Formula
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles

Cited in

(6)

• Multivariate Lagrange inversion formula and the cycle lemma
• scientific article; zbMATH DE number 1552328 (Why is no real title available?)
• Lagrange inversion and combinatorial species with uncountable color palette
• Counting trees using symmetries
• The mathematical life of Pierre Leroux
• A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885017)