Related papers: Computing the Volume of Polytropes

We introduce a "Hamiltonian"-like function, called the volume function, indispensable to describe the ensemble of jammed matter such as granular materials and emulsions from a geometrical point of view. The volume function represents the…

The polytopic definition introduced recently describing the topology of manifolds is used to formulate a generating function pertinent to its topological properties. In particular, a polynomial in terms of one variable and a tori underlying…

The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters. Determining the…

This paper collects some important formulas on hyperbolic volume. To determine concrete values of volume function is a very hard question requiring the knowledge of various methods. Our goal to give a non-elementary integral on the volume…

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 introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

We present computational data and heuristic arguments which suggest that given a hyperbolic knot the volume correlates with its determinant, the Mahler measure of its Alexander polynomial and the Mahler measure of the twisted Alexander…

We examine volume computation of general-dimensional polytopes and more general convex bodies, defined as the intersection of a simplex by a family of parallel hyperplanes, and another family of parallel hyperplanes or a family of…

We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…

The manuscript provides formulas for the volume of a body defined by the intersection of a solid cone and a solid sphere as a function of the sphere radius, of the distance between cone apex and sphere center, and of the cone aperture…

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

We develop a class of mixed virtual volume methods for elliptic problems on polygonal/polyhedral grids. Unlike the mixed virtual element methods introduced in \cite{brezzi2014basic,da2016mixed}, our methods are reduced to symmetric,…

For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

A number theoretic algorithm is given for writing gauge theory amplitudes in a compact manner. It is possible to write down all details of the complete $L$ loop amplitude with two integers, or a complex integer. However, a more symmetric…

We give a closed formula for volumes of generic hyperbolic tetrahedra in terms of edge lengths. The cue of our formula is by the volume conjecture for the Turaev-Viro invariant of closed 3-manifolds, which is defined from the quantum…

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

We study the problem of bounding the number of cusps of a complex hyperbolic manifold in terms of its volume. Applying algebro-geometric methods using Mumford's work on toroidal compactifications and its generalization due to N. Mok and…

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,…