Counting trees using symmetries

Authors:
Olivier Bernardi;Alejandro H. Morales
Affiliations:
-;-
Venue:
Journal of Combinatorial Theory Series A
Year:
2014

Citing 8
Cited 0

A combinatorial proof of the multivariable Lagrange inversion formula

Journal of Combinatorial Theory Series A
Some combinatorial problems associated with products of conjugacy classes of the symmetric group

Journal of Combinatorial Theory Series A
The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group

European Journal of Combinatorics
Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the Matrix tree theorem

Journal of Combinatorial Theory Series A
Coalscent random forests

Journal of Combinatorial Theory Series A
Regular Article: Enumeration of m-Ary Cacti

Advances in Applied Mathematics
Two bijective proofs for the arborescent form of the good-Lagrange formula and some applications to colored rooted trees and cacti

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Analytic Combinatorics

Analytic Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some results by Knuth and by Bousquet-Melou and Chapuy about embedded trees. We also give a new proof of the multivariate Lagrange inversion formula. Our strategy for counting trees is to exploit symmetries of refined enumeration formulas: proving these symmetries is easy, and once the symmetries are proved the formulas follow effortlessly. We also adapt this strategy to recover an enumeration formula of Goulden and Jackson for cacti counted according to their degree distribution.