Exact and asymptotic enumeration of cyclic permutations according to descent set

DOI10.1016/J.JCTA.2019.02.012MaRDI QIDQ2424916zbMATH OpenOpenAlexWikidataFDO

Authors Sergi Elizalde, Justin M. Troyka

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

cycledescent setpermutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given descent set). We then use this formula to show that, for almost all sets $Isubseteq[n-1]$, the fraction of size-$n$ permutations with descent set $I$ which are $n$-cycles is asymptotically $1/n$. As a special case, we recover a result of Stanley for alternating cycles. We also use our formula to count the cycles that do not have two consecutive descents.

Recommendations

• The number of cycles with a given descent set
• Descent sets of cyclic permutations
• Enumerations of permutations by circular descent sets
• Counting permutations with given cycle structure and descent set
• Permutations with ascending and descending blocks

Cites work

• A survey of alternating permutations
• A survey of consecutive patterns in permutations
• Alternating permutations and symmetric functions
• Analytic combinatorics
• Asymptotics of permutations with nearly periodic patterns of rises and falls
• Bijections for refined restricted permutations
• Consecutive patterns in permutations
• Continued fractions for permutation statistics
• Counting permutations with given cycle structure and descent set
• Cycle type and descent set in wreath products
• Cyclic permutations realized by signed shifts
• Descent sets of cyclic permutations
• Fixed points and excedances in restricted permutations
• Generalized descent patterns in permutations and associated Hopf algebras
• scientific article; zbMATH DE number 417855 (Why is no real title available?)
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 3895079 (Why is no real title available?)
• Maximizing the descent statistic
• Permutations with ascending and descending blocks
• Refined restricted permutations
• Riffle shuffles, cycles, and descents
• Signed permutation statistics and cycle type

Cited in

(20)

• Counting permutations with given cycle structure and descent set
• Cyclic permutations: degrees and combinatorial types
• Counting permutations by peaks, descents, and cycle type
• Plethystic formulas for permutation enumeration
• Enumerations of permutations by circular descent sets
• MacMahon's theorem for a set of permutations with given descent indices and right-maximal records
• Unimodal permutations and almost-increasing cycles
• The number of cycles with a given descent set
• Cycles on a multiset with only even-odd drops
• Descents of \(\lambda \)-unimodal cyclic permutations
• Number of permutations with given descent set and cycle structure
• 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
• The total number of descents and levels in tensor words and cyclic tensor words
• Counting simsun permutations by descents
• Cyclic permutations avoiding patterns in both one-line and cycle forms
• Characterizing avoidance in cycles via vincular patterns
• Growth rates of permutations with given descent or peak set
• Descent sets of cyclic permutations

Describes a project that uses

Uses Software

• AARON

This page was built for publication: Exact and asymptotic enumeration of cyclic permutations according to descent set

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