The Boustrophedon Transform for Descent Polytopes

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)67-72
Number of pages6
JournalAnnals of Combinatorics
Issue number1
StatePublished - Mar 7 2019

Bibliographical note

Funding 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).

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.


  • Alternating words
  • Descent polytopes
  • The boustrophedon transform
  • f-vector

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'The Boustrophedon Transform for Descent Polytopes'. Together they form a unique fingerprint.

Cite this