Title of article
Annular embeddings of permutations for arbitrary genus
Author/Authors
Goulden، نويسنده , , I.P. and Slofstra، نويسنده , , William، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
17
From page
272
To page
288
Abstract
In the symmetric group on a set of size 2n, let P 2 n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each disjoint cycle has length 2). Harer and Zagier explicitly determined the distribution of the number of disjoint cycles in the product of a fixed cycle of length 2n and the elements of P 2 n . Their famous result has been reproved many times, primarily because it can be interpreted as the genus distribution for 2-cell embeddings in an orientable surface, of a graph with a single vertex attached to n loops. In this paper we give a new formula for the cycle distribution when a fixed permutation with two cycles (say the lengths are p , q , where p + q = 2 n ) is multiplied by the elements of P 2 n . It can be interpreted as the genus distribution for 2-cell embeddings in an orientable surface, of a graph with two vertices, of degrees p and q. In terms of these graphs, the formula involves a parameter that allows us to specify, separately, the number of edges between the two vertices and the number of loops at each of the vertices. The proof is combinatorial, and uses a new algorithm that we introduce to create all rooted forests containing a given rooted forest.
Keywords
Rooted forest , Cycle distribution , Annular embedding , Map enumeration , Dipole , Ordered tree , Combinatorial bijection , Permutation counting
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series A
Record number
1531472
Link To Document