Minkowski Decomposition of Associahedra and Related Combinatorics
Carsten Lange

TL;DR
This paper explores Minkowski decompositions of associahedra, providing methods to compute their coefficients efficiently, and offers combinatorial interpretations linked to the geometry of their normal fans.
Contribution
It introduces simplified computation methods for Minkowski coefficients of associahedra and connects these to combinatorial structures and the geometry of their normal fans.
Findings
Efficient computation of tight right-hand sides for redundant inequalities.
Simplification of Minkowski coefficient calculations requiring at most four values.
A combinatorial interpretation of Minkowski coefficients using labeled polygons.
Abstract
Realisations of associahedra with linearly non-isomorphic normal fans can be obtained by alteration of the right-hand sides of the facet-defining inequalities from a classical permutahedron. These polytopes can be expressed as Minkowski sums and differences of dilated faces of a standard simplex as described by Ardila, Benedetti & Doker (2010). The coefficients of such a Minkowski decomposition can be computed by M\"obius inversion if tight right-hand sides are known not just for the facet-defining inequalities of the associahedron but also for all inequalities of the permutahedron that are redundant for the associahedron. We show for certain families of these associahedra: (a) how to compute tight values for the redundant inequalities from the values for the facet-defining inequalities; (b) the computation of the values of Ardila, Benedetti & Doker can…
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.
