arXiv Analytics

Sign in

arXiv:math/9804119 [math.CO]AbstractReferencesReviewsResources

Enumeration of m-ary cacti

Miklos Bona, Michel Bousquet, Gilbert Labelle, Pierre Leroux

Published 1998-04-24, updated 1999-01-28Version 2

The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m critical values, studied by Zvonkin and others. We obtain explicit formulae for both labelled and unlabelled m-ary cacti, according to i) the number of polygons, ii) the vertex-color distribution, iii) the vertex-degree distribution of each color. We also enumerate m-ary cacti according to the order of their automorphism group. Using a generalization of Otter's formula, we express the species of m-ary cacti in terms of rooted and of pointed cacti. A variant of the m-dimensional Lagrange inversion is then used to enumerate these structures. The method of Liskovets for the enumeration of unrooted planar maps can also be adapted to m-ary cacti.

Comments: LaTeX2e, 28 pages, 9 figures (eps), 3 tables
Journal: Advances in Applied Mathematics, 24 (2000), 22-56
Categories: math.CO
Subjects: 05A15, 05C30
Related articles: Most relevant | Search more
arXiv:math/0008209 [math.CO] (Published 2000-08-28)
Enumeration of chord diagrams
arXiv:0710.1370 [math.CO] (Published 2007-10-06, updated 2011-05-05)
A problem of enumeration of two-color bracelets with several variations
arXiv:1106.5480 [math.CO] (Published 2011-06-27, updated 2013-03-21)
Enumeration of Graded (3+1)-Avoiding Posets