Related papers: Volume of 4-polytopes from bivectors
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 this article we consider non-convex $4d$ polytopes in $\mathbb{R}^4$. The paper consist of two parts: Firstly, we extend the proof of the formula for the $4d$ volume in terms of $2d$ face bivectors and boundary graph crossings from…
It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.
This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
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 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…
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
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…
It is known that the volume function for hyperbolic manifolds of dimension $\geq 3$ is finite-to-one. We show that the number of nonhomeomorphic hyperbolic 4-manifolds with the same volume can be made arbitrarily large. This is done by…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and…
For any closed orientable 3-manifold, there is a volume function defined on the space of all Seifert representations of the fundamental group. The maximum absolute value of this function agrees with the Seifert volume of the manifold due to…
In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…
It is folklore that the cycle space of graphs of polytopes is generated by the cycles bounding the 2-faces. We provide a proof of this result that bypass homological arguments, which seem to be the most widely known proof. As a corollary,…
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…
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 provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
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.…