A versatile combinatorial approach of studying products of long cycles in symmetric groups

DOI10.1016/j.aam.2021.102283zbMath1478.05003arXiv1910.03571OpenAlexW3209994426MaRDI QIDQ2665756

Ricky X. F. Chen

Publication date: 19 November 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

factorizationexceedancecycle-typeplane permutationproduct of long cyclesseparation probability

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (1)

On products of permutations with the most uncontaminated cycles by designated labels

Cites Work

• Unnamed Item
• A simple model of trees for unicellular maps
• Odd permutations are nicer than even ones
• An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
• Bijective enumeration of some colored permutations given by the product of two long cycles
• Sorting permutations by block-interchanges
• A new combinatorial identity for unicellular maps, via a direct bijective approach
• On products of long cycles: short cycle dependence and separation probabilities
• The average number of block interchanges needed to sort a permutation and a recent result of Stanley
• How many ways can a permutation be factored into two n-cycles?
• Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
• Factorization of permutations into n-cycles
• Hypermaps versus bipartite maps
• Genus distributions for bouquets of circles
• Factoring \(n\)-cycles and counting maps of given genus
• Factorizations of an \(n\)-cycle into two \(n\)-cycles
• The Euler characteristic of the moduli space of curves
• Combinatorially refine a Zagier-Stanley result on products of permutations
• Two enumerative results on cycles of permutations
• Permutation statistics of products of random permutations
• Counting rooted maps by genus. I
• Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations
• Planar Maps are Well Labeled Trees
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Decomposing a Permutation into Two Large Cycles: An Enumeration
• Sorting by Transpositions
• On the local genus distribution of graph embeddings
• On the cycle structure of the product of random maximal cycles
• Separation Probabilities for Products of Permutations

This page was built for publication: A versatile combinatorial approach of studying products of long cycles in symmetric groups