Descent sets of cyclic permutations

DOI10.1016/J.AAM.2011.02.006zbMATH Open1233.05038arXiv0906.2795OpenAlexW2003410003MaRDI QIDQ719785FDOQ719785

Sergi Elizalde

Publication date: 11 October 2011

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

Abstract: We present a bijection between cyclic permutations of {1,2,...,n+1} and permutations of {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like transformation on the cyclic notation of the permutation, followed by certain conjugations. We also give an alternate derivation of the consequent result about the equidistribution of descent sets using work of Gessel and Reutenauer. Finally, we prove a conjecture of the author in [SIAM J. Discrete Math. 23 (2009), 765-786] and a conjecture of Eriksen, Freij and W"astlund.

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

Recommendations

• Enumerations of permutations by circular descent sets
• Number of permutations with given descent set and cycle structure
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Counting permutations with given cycle structure and descent set
• The descent set and connectivity set of a permutation
• Descents of \(\lambda \)-unimodal cyclic permutations
• Descent classes of permutations with a given number of fixed points
• The number of cycles with a given descent set
• The cycle descent statistic on permutations
• Generating functions for permutations which contain a given descent set

zbMATH Keywords

permutationdescentbijectioncycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Counting permutations with given cycle structure and descent set
• The Number of Permutations Realized By a Shift
• Enumeration of derangements with descents in prescribed positions

Cited In (12)

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

This page was built for publication: Descent sets of cyclic permutations

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