Cycle factorizations and 1-faced graph embeddings

DOI10.1016/J.EJC.2009.04.005zbMATH Open1188.05052arXiv0810.3892OpenAlexW1993832377WikidataQ114184871 ScholiaQ114184871MaRDI QIDQ1041191FDOQ1041191

Authors: Dimitri Zvonkine, Yu Burman 

Publication date: 1 December 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-faced embeddings of a given graph.

Full work available at URL: https://arxiv.org/abs/0810.3892

Recommendations

• Factorizations of large cycles in the symmetric group
• Short factorizations of permutations into transpositions
• Inequivalent transitive factorizations into transpositions
• Bijective enumeration of 3-factorizations of an \(N\)-cycle
• Bijections and symmetries for the factorizations of the long cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Transitive factorisations into transpositions and holomorphic mappings on the sphere
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Factorizations of large cycles in the symmetric group
• The Euler characteristic of the moduli space of curves
• An algebro-geometric proof of Witten’s conjecture
• Two-dimensional QCD is a string theory
• Tree-like properties of cycle factorizations
• The Gromov-Witten potential of a point, Hurwitz numbers, and Hodge integrals.
• Title not available (Why is that?)
• Enumeration of almost polynomial rational functions with given critical values

Cited In (7)

• Hurwitz numbers for the reflection groups \(B_n\) and \(D_n\)
• A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
• Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights
• Title not available (Why is that?)
• Matrix-tree theorems and discrete path integration
• Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
• Ribbon decomposition and twisted Hurwitz numbers

This page was built for publication: Cycle factorizations and 1-faced graph embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041191)