Counting simsun permutations by descents
From MaRDI portal
Publication:659654
DOI10.1007/S00026-011-0113-6zbMath1233.05023OpenAlexW1990813359MaRDI QIDQ659654
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
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)
Related Items (11)
The peak statistics on simsun permutations ⋮ Positivity and divisibility of enumerators of alternating descents ⋮ Enumeration of permutations by number of alternating runs ⋮ Restricted simsun permutations ⋮ Counting permutations by simsun successions ⋮ Permutations avoiding a simsun pattern ⋮ Enumeration of permutations by the parity of descent positions ⋮ Eulerian polynomials and the 𝑔-indices of Young tableaux ⋮ A refined sign-balance of simsun permutations ⋮ Refined restricted inversion sequences ⋮ Alternating Eulerian polynomials and left peak polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Permutation trees and variation statistics
- Flag \(f\)-vectors and the \(cd\)-index
- The homology of partitions with an even number of blocks
- Probabilistic bounds on the coefficients of polynomials with only real zeros
- On the \(cd\)-variation polynomials of André and Simsun permutations
- Central and local limit theorems applied to asymptotic enumeration
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Andre Permutations, Lexicographic Shellability and the cd-Index of a Convex Polytope
- Minimax trees and André polynomials
This page was built for publication: Counting simsun permutations by descents
