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-2zbMATH Open1048.05025OpenAlexW2085334526WikidataQ114121098 ScholiaQ114121098MaRDI QIDQ1885017FDOQ1885017

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

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

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)

Cites Work

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

Cited In (6)

• The mathematical life of Pierre Leroux
• Multivariate Lagrange inversion formula and the cycle lemma
• Lagrange inversion and combinatorial species with uncountable color palette
• A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences
• Title not available (Why is that?)
• Counting trees using symmetries

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)