Enumeration of m-ary cacti

被引:33
作者
Bóna, M [1 ]
Bousquet, M [1 ]
Labelle, G [1 ]
Leroux, P [1 ]
机构
[1] Univ Quebec, LACIM, Montreal, PQ H3C 3P8, Canada
关键词
D O I
10.1006/aama.1999.0665
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 rn 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 roared 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-ani Cacti. (C) 2000 Academic Press.
引用
收藏
页码:22 / 56
页数:35
相关论文
共 23 条
[1]  
[Anonymous], 1963, LECT STAT MECH
[2]  
[Anonymous], 1983, COMBINATORIAL ENUMER
[3]  
Bergeron F., 1998, ENCY MATH ITS APPL, V67
[4]  
BOUSQUET M, 1999, LACIM, V24
[5]  
BOUSQUET M, IN PRESS ANN SCI MAT
[6]  
BOUSQUETMELOU M, IN PRESS ADV APPL MA
[7]   ENUMERATION OF TREES AND FORMAL SERIES INVERSION FORMULAS [J].
CHOTTIN, L .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (01) :23-45
[8]   COMBINATIVE DEMONSTRATION OF LAGRANGE FORMULA WITH 2 VARIABLES [J].
CHOTTIN, L .
DISCRETE MATHEMATICS, 1975, 13 (03) :215-224
[9]  
ELMARRAKI M, 1907, SEMINAIRE LOTHARINGI, V37
[10]   THE COMBINATORIAL RELATIONSHIP BETWEEN TREES, CACTI AND CERTAIN CONNECTION COEFFICIENTS FOR THE SYMMETRICAL GROUP [J].
GOULDEN, IP ;
JACKSON, DM .
EUROPEAN JOURNAL OF COMBINATORICS, 1992, 13 (05) :357-365