Abstract
We give a short proof that the f-vector of the descent polytope DPv is componentwise maximized when the word v is alternating. Our proof uses an f-vector analog of the boustrophedon transform.
Original language | English |
---|---|
Pages (from-to) | 67-72 |
Number of pages | 6 |
Journal | Annals of Combinatorics |
Volume | 23 |
Issue number | 1 |
DOIs | |
State | Published - Mar 7 2019 |
Bibliographical note
Publisher Copyright:© 2019, Springer Nature Switzerland AG.
Keywords
- Alternating words
- Descent polytopes
- The boustrophedon transform
- f-vector
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics