Related papers: Algebraic Volume for Polytope Arise from Ehrhart T…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
This is the second of two papers where we study polytopes arising from affine Coxeter arrangements. Our results include a formula for their volumes, and also compatible definitions of hypersimplices, descent numbers and major index for all…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $\delta(\Pc)=(\delta_0, \delta_1,..., \delta_d)$ the $\delta$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^d\delta_i$ its normalized volume. In this paper, we will…
Filliman duality expresses (the characteristic measure of) a convex polytope P containing the origin as an alternating sum of simplices that share supporting hyperplanes with P. The terms in the alternating sum are given by a triangulation…
Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an $n$-dimensional convex body within…
Given five points in a three-dimensional euclidean space, one can consider five tetrahedra, using those points as vertices. We present a pentagon-like formula containing the product of three volumes of those tetrahedra in its l.h.s. and the…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to…
A generalized hyperbolic tetrahedra is a polyhedron (possibly non-compact) with finite volume in hyperbolic space, obtained from a tetrahedron by the polar truncation at the vertices lying outside the space. In this paper it is proved that…
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…
Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…
Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…
The volume of the unit ball of the Lebesgue sequence space $\ell_p^m$ is very well known since the times of Dirichlet. We calculate the volume of the unit ball in the mixed norm $\ell^n_q(\ell_p^m)$, whose special cases are nowadays popular…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
We study the volume entropy of a class of presentations (including the classical ones) for all surface groups, called \emph{minimal geometric presentations}. We rediscover a formula first obtained by Cannon and Wagreich with the computation…
A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…