Exact and asymptotic enumeration of cyclic permutations according to descent set

DOI10.1016/j.jcta.2019.02.012zbMath1414.05010arXiv1710.05103OpenAlexW2766859076WikidataQ128229856 ScholiaQ128229856MaRDI QIDQ2424916

Justin M. Troyka, Sergi Elizalde

Publication date: 25 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

cyclepermutationdescent set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

The number of cycles with a given descent set, Enumerating two permutation classes by the number of cycles, Higher Lie characters and cyclic descent extension on conjugacy classes, Higher Lie characters and cyclic descent extension on conjugacy classes, Plethystic formulas for permutation enumeration

Uses Software

• AARON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bijections for refined restricted permutations
• Fixed points and excedances in restricted permutations
• Descent sets of cyclic permutations
• Alternating permutations and symmetric functions
• Maximizing the descent statistic
• Counting permutations with given cycle structure and descent set
• Signed permutation statistics and cycle type
• Cycle type and descent set in wreath products
• Consecutive patterns in permutations
• Refined restricted permutations
• Asymptotics of permutations with nearly periodic patterns of rises and falls
• Riffle shuffles, cycles, and descents
• Permutations with ascending and descending blocks
• Generalized descent patterns in permutations and associated Hopf algebras
• Cyclic permutations realized by signed shifts
• A survey of consecutive patterns in permutations
• A Survey of Alternating Permutations
• Continued fractions for permutation statistics