Related papers: On Volumes of Permutation Polytopes

Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…

Equivariant Ehrhart theory enumerates the lattice points in a polytope with respect to a group action. Answering a question of Stapledon, we describe the equivariant Ehrhart theory of the permutahedron, and we prove his Effectiveness…

The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…

We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…

This book is an introduction to the nascent field of Fourier analysis on polytopes, and cones. There is a rapidly growing number of applications of these methods, so it is appropriate to invite students, as well as professionals, to the…

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

We establish a connection between the orbifold cohomology of hypertoric varieties and the Ehrhart theory of Lawrence polytopes. More specifically, we show that the dimensions of the orbifold cohomology groups of a hypertoric variety are…

De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…

We observe that fullerene graphs are one-skeletons of polyhedra, which can be realized with all dihedral angles equal to $\pi/2$ in a hyperbolic 3-dimensional space. One of the most important invariants of such a polyhedron is its volume.…

Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…

We initiate the study of analogues of symmetric spaces for the family of finite dihedral groups. In particular, we investigate the structure of the automorphism group, characterize the involutions of the automorphism group, and determine…

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Volume entropy is an important invariant of metric graphs as well as Riemannian manifolds. In this note, we calculate the change of volume entropy when an edge is added to a metric graph. Using the first result, we investigate the change of…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

In this paper, we compute the covolume of the group of units of the quadratic form f_d^n(x) = x_1^2 + x_2^2 + . . . + x_n^2 - d x_{n+1}^2 with d an odd, positive, square-free integer. Mcleod has determined the hyperbolic Coxeter fundamental…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the…