Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
From MaRDI portal
Publication:3801557
DOI10.2307/2000524zbMath0655.05005OpenAlexW4234619973MaRDI QIDQ3801557
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2000524
Exact enumeration problems, generating functions (05A15) Ordinary representations and characters (20C15) Isotopy and pseudo-isotopy (57N37)
Related Items (52)
A general framework for the polynomiality property of the structure coefficients of double-class algebras ⋮ A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case ⋮ Counting coloured planar maps: differential equations ⋮ On the average genus of a graph ⋮ Another proof of the Harer-Zagier formula ⋮ Stratified graphs for imbedding systems ⋮ The asymptotic number of tree-rooted maps on a surface ⋮ Finite covers of random 3-manifolds ⋮ The genus series for maps ⋮ Positivity results for Stanley's character polynomials ⋮ Random 2-cell embeddings of multistars ⋮ A versatile combinatorial approach of studying products of long cycles in symmetric groups ⋮ Embedding distributions and Chebyshev polynomials ⋮ Enumerating graph embeddings and partial-duals by genus and Euler genus ⋮ Combinatorially refine a Zagier-Stanley result on products of permutations ⋮ Calculating the Euler characteristic of the moduli space of curves ⋮ On products of long cycles: short cycle dependence and separation probabilities ⋮ On products of permutations with the most uncontaminated cycles by designated labels ⋮ Combinatorial conjectures that imply local log-concavity of graph genus polynomials ⋮ An Introduction to Random Topological Graph Theory ⋮ On the genus distributions of wheels and of related graphs ⋮ Odd permutations are nicer than even ones ⋮ Character-theoretic techniques for near-central enumerative problems ⋮ Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule ⋮ Region distributions of graph embeddings and Stirling numbers ⋮ Unnamed Item ⋮ Semidefinite programming for permutation codes ⋮ Reflection factorizations of Singer cycles ⋮ Counting orientable embeddings by genus for a type of 3-regular graph ⋮ A generic method for bijections between blossoming trees and planar maps ⋮ Rationality in map and hypermap enumeration by genus ⋮ A geometric parametrization for the virtual Euler characteristics of the moduli spaces of real and complex algebraic curves ⋮ A \(D\)-finiteness result for products of permutations ⋮ The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group ⋮ Matrix integrals and map enumeration: an accessible introduction ⋮ The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees ⋮ A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions ⋮ A new combinatorial identity for unicellular maps, via a direct bijective approach ⋮ Genera of Cayley maps ⋮ \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group ⋮ Unnamed Item ⋮ The generating function of planar Eulerian orientations ⋮ Genus distributions for bouquets of circles ⋮ Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations ⋮ Counting non-isomorphic chord diagrams ⋮ Some combinatorial problems associated with products of conjugacy classes of the symmetric group ⋮ Genus distribution of ladder type and cross type graphs ⋮ Log-Concavity of Combinations of Sequences and Applications to Genus Distributions ⋮ Region distributions of some small diameter graphs ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson ⋮ Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\) ⋮ Virasoro constraints and topological recursion for Grothendieck's dessin counting
Cites Work
This page was built for publication: Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
