English

Counting trees using symmetries

Combinatorics 2013-04-08 v3

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-M\'elou 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.

Keywords

Cite

@article{arxiv.1206.0598,
  title  = {Counting trees using symmetries},
  author = {Olivier Bernardi and Alejandro H. Morales},
  journal= {arXiv preprint arXiv:1206.0598},
  year   = {2013}
}

Comments

17 pages, 7 figures

R2 v1 2026-06-21T21:13:50.515Z