Pattern-Avoiding Polytopes
Robert Davis, Bruce Sagan

TL;DR
This paper studies polytopes derived from pattern-avoiding permutations, analyzing their combinatorial and geometric properties such as Ehrhart polynomials, volumes, and triangulations, with connections to well-known polytopes and algebraic structures.
Contribution
It introduces and analyzes new classes of polytopes based on pattern-avoiding permutations, providing explicit results for their Ehrhart polynomials, volumes, and triangulations, and linking them to algebraic and combinatorial objects.
Findings
P_n(123,132) is a Pitman-Stanley polytope
Number of interior lattice points in P_n(132,312) equals derangement number
Normalized volume of P_n(123,231,312) counts trees on n vertices
Abstract
Two well-known polytopes whose vertices are indexed by permutations in the symmetric group are the permutohedron and the Birkhoff polytope . We consider polytopes and , whose vertices correspond to the permutations in avoiding a set of patterns . For various choices of , we explore the Ehrhart polynomials and -vectors of these polytopes as well as other aspects of their combinatorial structure. For , we consider all subsets and are able to provide results in most cases. To illustrate, is a Pitman-Stanley polytope, the number of interior lattice points in is a derangement number, and the normalized volume of is the number of trees on vertices. The polytopes seem much more difficult to analyze, so we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
