相关论文: Approximating the Volume of Tropical Polytopes is …

Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied…

This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups, dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the…

The asymptotic volume of the polytope of symmetric stochastic matrices can be determined by asymptotic enumeration techniques as in the case of the Birkhoff polytope. These methods can be extended to polytopes of symmetric stochastic…

We give a characterization of the minimal tropical half-spaces containing a given tropical polyhedron, from which we derive a counter example showing that the number of such minimal half-spaces can be infinite, contradicting some statements…

Let m,n be positive integers. Define T(m,n) to be the transportation polytope consisting of the m x n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case B(n)=T(n,n) is the much-studied…

When a tropical rational function \varphi on R^n is given, we can represent it as \varphi=f-g with tropical polynomials f and g. We develop the duality theorem for tropical rational functions to define the volume of the pair (f, g). We show…

A very brief introduction to tropical and idempotent mathematics is presented. Tropical mathematics can be treated as a result of a dequantization of the traditional mathematics as the Planck constant tends to zero taking imaginary values.…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

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 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 study a rational matroid invariant, obtained as the tropicalization of the Feynman period integral. It equals the volume of the polar of the matroid polytope and we give efficient formulas for its computation. This invariant is proven to…

The Maximum Weight Independent Set of Polygons problem is a fundamental problem in computational geometry. Given a set of weighted polygons in the 2-dimensional plane, the goal is to find a set of pairwise non-overlapping polygons with…

In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the…

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…

We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both…

For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for solving symmetric integer linear programs (ILPs). An integer…

We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…

Exploiting a connection between amoebas and tropical curves, we devise a method for computing tropical curves using numerical algebraic geometry and give an implementation. As an application, we use this technique to compute Newton polygons…

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…

We study how geometric properties of tropical convex sets and polytopes, which are of interest in many application areas, manifest themselves in their algebraic structure as modules over the tropical semiring. Our main results establish a…