Cycle factorizations and 1-faced graph embeddings
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 1066473 (Why is no real title available?)
- An algebro-geometric proof of Witten’s conjecture
- Enumeration of almost polynomial rational functions with given critical values
- Factorizations of large cycles in the symmetric group
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- The Euler characteristic of the moduli space of curves
- The Gromov-Witten potential of a point, Hurwitz numbers, and Hodge integrals.
- Transitive factorisations into transpositions and holomorphic mappings on the sphere
- Tree-like properties of cycle factorizations
- Two-dimensional QCD is a string theory
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
- scientific article; zbMATH DE number 7664091 (Why is no real title available?)
- 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)