The Boustrophedon Transform for Descent Polytopes

Richard Ehrenborg; Alex Happ

doi:10.1007/s00026-019-00422-1

The Boustrophedon Transform for Descent Polytopes

Richard Ehrenborg, Alex Happ

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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	https://doi.org/10.1007/s00026-019-00422-1
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

Access to Document

10.1007/s00026-019-00422-1

Cite this

@article{712849de9ddf47b5bdd71067c38fe566,

title = "The Boustrophedon Transform for Descent Polytopes",

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.",

keywords = "Alternating words, Descent polytopes, The boustrophedon transform, f-vector",

author = "Richard Ehrenborg and Alex Happ",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.",

year = "2019",

month = mar,

day = "7",

doi = "10.1007/s00026-019-00422-1",

language = "English",

volume = "23",

pages = "67--72",

number = "1",

}

TY - JOUR

T1 - The Boustrophedon Transform for Descent Polytopes

AU - Ehrenborg, Richard

AU - Happ, Alex

PY - 2019/3/7

Y1 - 2019/3/7

N2 - 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.

AB - 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.

KW - Alternating words

KW - Descent polytopes

KW - The boustrophedon transform

KW - f-vector

UR - http://www.scopus.com/inward/record.url?scp=85061437685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061437685&partnerID=8YFLogxK

U2 - 10.1007/s00026-019-00422-1

DO - 10.1007/s00026-019-00422-1

M3 - Article

AN - SCOPUS:85061437685

SN - 0218-0006

VL - 23

SP - 67

EP - 72

JO - Annals of Combinatorics

JF - Annals of Combinatorics

IS - 1

ER -

The Boustrophedon Transform for Descent Polytopes

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this