Related papers: Algebraic Volume for Polytope Arise from Ehrhart T…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamental in algebraic elimination, optimization, and geometric…

In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

This is an introduction to the Volume Conjecture and its generalizations for nonexperts. The Volume Conjecture states that a certain limit of the colored Jones polynomial of a knot would give the volume of its complement. If we deform the…

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…

The purpose of this article is to investigate the geometry of the set of locally diagonalizable bipartite quantum states. We have the following new results: the Hilbert-Schmidt volume of all locally diagonalizable states, and a necessary…

We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff polytopes using a slicing method. We construct the basis from a special set of square matrices. We explain how to construct this basis easily…

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…

We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…

Let $\Delta_n$ and $Q_n$ denote the regular $n$-simplex of side length $\sqrt{2}$ embedded in $\mathbb{R}^{n+1}$ and the volume one cube in $\mathbb{R}^n$, respectively. We derive a closed-form formula for the hyperplane volume projections…

We introduce a theory of volume polynomials and corresponding duality algebras of multi-fans. Any complete simplicial multi-fan $\Delta$ determines a volume polynomial $V_\Delta$ whose values are the volumes of multi-polytopes based on…

Counting lattice points within a rational polytope is a foundational problem with applications across mathematics and computer science. A key approach is Barvinok's algorithm, which decomposes the lattice point generating function of cones…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We derive the Weil-Petersson measure on the moduli space of hyperbolic surfaces with defects of arbitrary opening angles and use this to compute its volume. We conjecture a matrix integral computing the corresponding volumes and confirm…

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…