Related papers: On Volumes of Permutation Polytopes
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
A real representation of a finite group naturally determines a polytope, generalizing the well-known Birkhoff polytope. This paper determines the structure of the polytope corresponding to the natural permutation representation of a general…
In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…
Describing the geometry of the dual amplituhedron without reference to a particular triangulation is an open problem. In this note we introduce a new way of determining the volume of the tree-level NMHV dual amplituhedron. We show that…
The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
In a recent project, Castillo, Libedinsky, Plaza, and the author established a deep connection between the size of lower Bruhat intervals in affine Weyl groups and the volume of the permutohedron, showing that the former can be expressed as…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
Recently, Benedetti et al. introduced an Ehrhart-like polynomial associated to a graph. This polynomial is defined as the volume of a certain flow polytope related to a graph and has the property that the leading coefficient is the volume…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…
In these notes, we explain residue formulae for volumes of convex polytopes, and for Ehrahrt polynomials based on the notion of total residue. We apply this method to the computation of the volume of the Chan-Robbins polytope. The final…
The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
In this paper, we consider the cohomology rings of some multiple weight varieties of type A, that is, symplectic torus quotients for a direct product of several coadjoint orbits of the special unitary group. Under some specific assumptions,…
In this article we prove a formula for the volume of 4-dimensional polytopes, in terms of their face bivectors, and the crossings within their boundary graph. This proves that the volume is an invariant of bivector-coloured graphs in $S^3$.
We report on enumerating the triangulations of cyclic polytopes with the new software mptopcom. This is relevant for its connection with higher Stasheff-Tamari orders, which occur in category theory and algebraic combinatorics.