A probabilistic approach to the descent statistic
From MaRDI portal
Publication:1601427
DOI10.1006/JCTA.2001.3233zbMath1005.05005OpenAlexW2150654349MaRDI QIDQ1601427
Publication date: 26 June 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2001.3233
Related Items (10)
Asymptotics of the Euler number of bipartite graphs ⋮ The expectation of the Vandermonde product squared for uniform random variables ⋮ The Ehrhart and face polynomials of the graph polytope of a cycle ⋮ The \(f\)-vector of the descent polytope ⋮ Descent pattern avoidance ⋮ The asymptotics of almost alternating permutations ⋮ Cyclically Consecutive Permutation Avoidance ⋮ Cyclotomic factors of the descent set polynomial ⋮ Zigzag diagrams and Martin boundary ⋮ Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotics of almost alternating permutations
- Permutations ayant une forme donnée
- Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
- Équidistribution des permutations ayant une forme donnée selon les avances et coavances
- Maximizing the descent statistic
- Permutation statistics of indexed permutations
- Maximizing Möbius functions on subsets of Boolean algebras
- The excedance set of a permutation
- The extended f-vectors of 4-polytopes
- 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
This page was built for publication: A probabilistic approach to the descent statistic