Maximizing the descent statistic
From MaRDI portal
Publication:1305195
DOI10.1007/BF01608482zbMath0929.05003MaRDI QIDQ1305195
Richard Ehrenborg, Swapneel Mahajan
Publication date: 30 September 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)
Related Items
Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic ⋮ The number of cycles with a given descent set ⋮ Exact and asymptotic enumeration of cyclic permutations according to descent set ⋮ The \(f\)-vector of the descent polytope ⋮ The asymptotics of almost alternating permutations ⋮ Cyclotomic factors of the descent set polynomial ⋮ Order-chain polytopes ⋮ The excedance set of a permutation ⋮ A probabilistic approach to the descent statistic ⋮ On meteors, earthworms and wimps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutations ayant une forme donnée
- Équidistribution des permutations ayant une forme donnée selon les avances et coavances
- Enumeration of permutations with prescribed up-down and inversion sequences
- Permutation statistics of indexed permutations
- Maximizing Möbius functions on subsets of Boolean algebras
- Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron
- A new operation on sequences: The boustrophedon transform
- The r-cubical lattice and a generalization of the cd-index
- Shellable and Cohen-Macaulay Partially Ordered Sets