Descent sets of cyclic permutations

DOI10.1016/j.aam.2011.02.006zbMath1233.05038arXiv0906.2795OpenAlexW2003410003MaRDI QIDQ719785

Sergi Elizalde

Publication date: 11 October 2011

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

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

zbMATH Keywords

cyclepermutationbijectiondescent

Mathematics Subject Classification ID

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

Related Items

Descents of \(\lambda\)-unimodal cycles in a character formula, Transformation à la Foata for special kinds of descents and excedances, The number of cycles with a given descent set, Unimodal permutations and almost-increasing cycles, Involutions and the Gelfand character, Exact and asymptotic enumeration of cyclic permutations according to descent set, Allowed Patterns of Symmetric Tent Maps via Commuter Functions, Permutations and \(\beta \)-shifts, Plethystic formulas for permutation enumeration, Monotonous subsequences and the descent process of invariant random permutations, Characterization of the allowed patterns of signed shifts

Cites Work

• Unnamed Item
• Enumeration of derangements with descents in prescribed positions
• Counting permutations with given cycle structure and descent set
• The Number of Permutations Realized By a Shift