Counting simsun permutations by descents

DOI10.1007/S00026-011-0113-6MaRDI QIDQ659654zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 24 January 2012

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-011-0113-6

zbMATH Keywords

André treesasymptotically normaldescentssimsun permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Recommendations

• Counting permutations by simsun successions
• Counting permutations by alternating descents
• The descent statistic on signed simsun permutations
• Enumeration of permutations by number of alternating descents
• Counting permutations with given cycle structure and descent set
• Enumeration of permutations by the parity of descent positions
• Enumerations of permutations by circular descent sets
• The peak statistics on simsun permutations
• Alternating permutations and the mth descents
• Exact and asymptotic enumeration of cyclic permutations according to descent set

Cites work

• Andre Permutations, Lexicographic Shellability and the cd-Index of a Convex Polytope
• Central and local limit theorems applied to asymptotic enumeration
• Central and local limit theorems for the coefficients of polynomials of binomial type
• Flag \(f\)-vectors and the \(cd\)-index
• scientific article; zbMATH DE number 3425611 (Why is no real title available?)
• scientific article; zbMATH DE number 48198 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 848099 (Why is no real title available?)
• Minimax trees and André polynomials
• On the \(cd\)-variation polynomials of André and Simsun permutations
• Permutation trees and variation statistics
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• The homology of partitions with an even number of blocks
• Unimodal, log-concave and Pólya frequency sequences in combinatorics

Cited in

(13)

• Restricted simsun permutations
• Alternating Eulerian polynomials and left peak polynomials
• Positivity and divisibility of enumerators of alternating descents
• Permutations avoiding a simsun pattern
• Counting permutations by simsun successions
• A refined sign-balance of simsun permutations
• The peak statistics on simsun permutations
• Enumeration of permutations by number of alternating runs
• The descent statistic on signed simsun permutations
• Moments of an exponential functional of random walks to permutations with given descent sets
• Enumeration of permutations by the parity of descent positions
• Eulerian polynomials and the 𝑔-indices of Young tableaux
• On the joint distributions of succession and Eulerian statistics

This page was built for publication: Counting simsun permutations by descents

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