On products of long cycles: short cycle dependence and separation probabilities

DOI10.1007/S10801-014-0578-6zbMATH Open1326.05171OpenAlexW2068711047MaRDI QIDQ894246FDOQ894246

Authors: Valentin Féray, Amarpreet Rattan 

Publication date: 30 November 2015

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

Abstract: We present various results on multiplying cycles in the symmetric group. Our first result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on $n$ symbols as a product of an $n$-cycle and an $n-1$-cycle is independent of the permutation chosen. We give a number of different approaches of our generalisation. One partial proof uses an inductive method which we also apply to other problems. In particular, we give a formula for the distribution of the number of cycles over all products of cycles of fixed lengths. Another application is related to the recent notion of separation probabilities for permutations introduced by Bernardi, Du, Morales and Stanley (2014).

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

Recommendations

• A versatile combinatorial approach of studying products of long cycles in symmetric groups
• Separation probabilities for products of permutations
• scientific article; zbMATH DE number 9561
• Permutations without long or short cycles
• Two enumerative results on cycles of permutations

zbMATH Keywords

symmetric groupproducts of cyclesseparation probabilities

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Symmetric groups (20B30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
• Bijective enumeration of some colored permutations given by the product of two long cycles
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Explicit generating series for connection coefficients
• Factoring \(n\)-cycles and counting maps of given genus
• Factorization of permutations into n-cycles
• 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
• Odd permutations are nicer than even ones
• Separation probabilities for products of permutations
• The centres of symmetric group rings
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Two enumerative results on cycles of permutations

Cited In (5)

• Separation probabilities for products of permutations
• A versatile combinatorial approach of studying products of long cycles in symmetric groups
• On products of permutations with the most uncontaminated cycles by designated labels
• Bijective enumeration of some colored permutations given by the product of two long cycles
• Cyclic products and optimal traps in cyclic birth and death chains

This page was built for publication: On products of long cycles: short cycle dependence and separation probabilities

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