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.
|Number of pages||6|
|Journal||Annals of Combinatorics|
|State||Published - Mar 7 2019|
Bibliographical noteFunding Information:
The authors are grateful to the two referees for their comments on an earlier version of this paper, including contributing the question in the concluding remark. This work was supported by a grant from the Simons Foundation (#429370, Richard Ehrenborg).
© 2019, Springer Nature Switzerland AG.
- Alternating words
- Descent polytopes
- The boustrophedon transform
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics