$c$-Birkhoff polytopes

Abstract

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\dots 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.

46 pages, 12 figures

References in corpus (12)

• Clusters, Coxeter-sortable elements and noncrossing partitions
• Cambrian Lattices
• Noncrossing partitions and representations of quivers
• Cambrian fans
• Sortable elements and Cambrian lattices
• A Generating Function for all Semi-Magic Squares and the Volume of the Birkhoff Polytope
• Lattice theory of torsion classes: Beyond $\tau$-tilting theory
• Preprojective algebras and c-sortable words
• Markov bases for noncommutative Fourier analysis of ranked data
• Cambrian combinatorics on quiver representations (type A)
• On Maximal Green Sequences For Type A Quivers
• Ungarian Markov Chains