Related papers: Computing the Volume of Polytropes
This paper proposes a new volume function for calculation of the entropy of planar granular assemblies. This function is extracted from the antisymmetric part of a new geometric tensor and is rigorously additive when summed over grains. It…
We present a package 'MixedMultiplicity' for computing mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over a field. This enables us to find mixed volumes of convex lattice polytopes…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
Volume is a natural measure of complexity of a Riemannian manifold. In this survey, we discuss the results and conjectures concerning n-dimensional hyperbolic manifolds and orbifolds of small volume.
A polyhedral method to solve a system of polynomial equations exploits its sparse structure via the Newton polytopes of the polynomials. We propose a hybrid symbolic-numeric method to compute a Puiseux series expansion for every space curve…
In this work we introduce a novel weighted message-passing algorithm based on the cavity method to estimate volume-related properties of random polytopes, properties which are relevant in various research fields ranging from metabolic…
We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant…
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
We present an algorithm for computing approximate $\ell_p$ Lewis weights to high precision. Given a full-rank $\mathbf{A} \in \mathbb{R}^{m \times n}$ with $m \geq n$ and a scalar $p>2$, our algorithm computes $\epsilon$-approximate…
Using the information geometry approach, we determine the volume of the set of two-qubit states with maximally disordered subsystems. Particular attention is devoted to the behavior of the volume of sub-manifolds of separable and entangled…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
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…
This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…
Let $P_1,\dots, P_n$ and $Q_1,\dots, Q_n$ be convex polytopes in $\mathbb{R}^n$ such that $P_i\subset Q_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,\dots,P_n)\leq V(Q_1,\dots,Q_n)$. We give two criteria…
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…
Using the celebrated Morris Constant Term Identity, we deduce a recent conjecture of Chan, Robbins, and Yuen (math.CO/9810154), that asserts that the volume of a certain $n(n-1)/2$-dimensional polytope is given by the product of the first…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
The calculation of volumes of polyhedra in the three-dimensional Euclidean, spherical and hyperbolic spaces is very old and difficult problem. In particular, an elementary formula for volume of non-euclidean simplex is still unknown. One of…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and…