Enumerations of permutations by circular descent sets

DOI10.11650/TJM/190105MaRDI QIDQ2279386zbMATH OpenOpenAlexFDO

Authors Hungyung Chang, Jun Ma, Jean Yeh

Publication date 12 December 2019

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.0433, https://projecteuclid.org/euclid.twjm/1548666174

zbMATH Keywords

circular descentgenerating treepermutationpermutation tableaux

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10)

Abstract: The circular descent of a permutation $sigma$ is a set $sigma(i)midsigma(i)>sigma(i+1)$. In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cde{s}_n(S)$ be the number of permutations of length $n$ which have the circular descent set $S$. We derive the explicit formula for $cde{s}_n(S)$. We describe a class of generating binary trees $T_k$ with weights. We find that the number of permutations in the set $CDE{S}_n(S)$ corresponds to the weights of $T_k$. As a application of the main results in this paper, we also give the enumeration of permutation tableaux according to their shape.

Recommendations

• Exact and asymptotic enumeration of cyclic permutations according to descent set
• The number of cycles with a given descent set
• Descents of derangements and circular words
• Descent sets of cyclic permutations
• Counting permutations with given cycle structure and descent set

Cites work

• A Combinatorial Interpretation of the Seidel Generation of Genocchi Numbers
• A Conjectured Representation of Genocchi Numbers
• A Markov Chain on Permutations which Projects to the PASEP
• Bijections for permutation tableaux
• Crossings and alignments of permutations
• Derangements and Genocchi numbers
• Enumeration of totally positive Grassmann cells
• scientific article; zbMATH DE number 2186886 (Why is no real title available?)
• Interpretations combinatoires des nombres de Genocchi
• Permutation tableaux and permutation patterns
• Proof of a conjecture on Genocchi numbers
• Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials
• Sur une conjecture de Gandhi concernant les nombres de Genocchi
• The number of Baxter permutations
• Une propriété de symétrie des nombres de Genocchi

Cited in

(8)

• An order on circular permutations
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Descents of derangements and circular words
• Cycles on a multiset with only even-odd drops
• On cyclic descents for tableaux
• Enumeration of bigrassmannian permutations below a permutation in Bruhat order
• Counting simsun permutations by descents
• Descent sets of cyclic permutations

This page was built for publication: Enumerations of permutations by circular descent sets

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