c -Birkhoff polytopes
Algebraic Combinatorics · 03.03.2026 · 9 (1) · 183-230
DOI: 10.5802/alco.472 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 03.03.2026. Verfasst von Esther Banaian und 3 weiteren Autor:innen. Die Arbeit nennt 57 Literaturangaben.
Abstract (Originalsprache)
In a 2018 paper, Davis and Sagan studied several pattern-avoiding polytopes. They found that a particular pattern-avoiding Birkhoff polytope had the same normalized volume as the order polytope of a certain poset, leading them to ask if the two polytopes were unimodularly equivalent. Motivated by Davis and Sagan’s question, in this paper we define a pattern-avoiding Birkhoff polytope called a c -Birkhoff polytope for each Coxeter element c of the symmetric group. We then show that the c -Birkhoff polytope is unimodularly equivalent to the order polytope of the heap poset of the c -sorting word of the longest permutation. When c = s 1 s 2 ⋯ s n , this result recovers an affirmative answer to Davis and Sagan’s question. Another consequence of this result is that the normalized volume of the c -Birkhoff polytope is the number of the longest chains in the (type A) c -Cambrian lattice.
Zitieren
APA
Banaian, E., Chepuri, S., Gunawan, E., & Pan, J. (2026). c -Birkhoff polytopes. Algebraic Combinatorics, 9(1), 183-230. https://doi.org/10.5802/alco.472
Vancouver
Banaian E, Chepuri S, Gunawan E, Pan J. c -Birkhoff polytopes. Algebraic Combinatorics. 2026;9(1):183-230. doi:10.5802/alco.472
BibTeX
@article{Banaian2026,
author = {Banaian, Esther and Chepuri, Sunita and Gunawan, Emily and Pan, Jianping},
title = {c -Birkhoff polytopes},
journal = {Algebraic Combinatorics},
year = {2026},
volume = {9},
number = {1},
pages = {183--230},
doi = {10.5802/alco.472}
}
EUVIMED