FactoringN-Cycles and Counting Maps of Given Genus
✍ Scribed by A. Goupil; Gilles Schaeffer
- Book ID
- 102568079
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 265 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
We present an explicit expression for the number of decompositions of an n-cycle as a product of any two permutations of cycle types given by partitions λ and µ. The same expression is also counting the number of unicellular rooted bicolored maps on an orientable surface of genus g with vertex degree distribution given by λ and µ. The relation between the genus and the partitions λ and µ is given by (λ) + (µ) = n + 1 -2g where (λ) is the number of parts of λ. We use character theory and the group algebra of the symmetric group to develop our expression. The key argument is the construction of a bijection involving the character formula at one end and our final expression at the other end.
Nous présentons une formule qui donne le nombre de décompositions d'un n-cycle en produit de deux permutations dont les types cycliques, respectivement λ et µ, sont quelconques. La même expression dénombre également les cartes à une face, bicolorées et enracinées sur une surface orientable de genre g dont les sommets appartenant à chaque couleur ont pour distribution de degrés les partages λ et µ. La relation unissant le genre aux partitions λ et µ est (λ) + (µ) = n + 1 -2g où (λ) est le nombre de parts de λ. Nos arguments sont développés dans le contexte de la théorie des caractères et du centre de l'algèbre de groupe du groupe symétrique. L'essentiel de notre argumentation consiste en la construction d'une bijection reliant d'une part, la formule des caractères et d'autre part, notre nouvelle expression.
📜 SIMILAR VOLUMES
Abstrart. The maximum genus of a connected graph (: is the maximum among the genera of a!1 cornpact olientable 2-manifolds upon which G has 2-&l embeddings. In the theorems that fc-llow the use of an edg;:-adding techniq se is combined with ihe well-known Edmonds' technique to prfiruce the desired r
In 2-edge-colored graphs, w e define an (s, t)-cycle to be a cycle of length s + t, in which s consecutive edges are in one color and the remaining t edges are in the other color. Here w e investigate the existence of (s, t)-cycles, in a 2-edge-colored complete graph KE on n vertices. In particular,