The Boustrophedon Transform for Descent Polytopes

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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

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