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

The face lattice of the permutohedron realizes the combinatorics of linearly ordered partitions of the set $[n]=\{1,...,n\}$. Similarly, the cyclopermutohedron is a virtual polytope that realizes the combinatorics of cyclically ordered…

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

We develop a tropical analog of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m+n)) time, where m…

Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an…

We investigate the entropy counting for black hole horizons in loop quantum gravity (LQG). We argue that the space of 3d closed polyhedra is the classical counterpart of the space of SU(2) intertwiners at the quantum level. Then computing…

Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want…

Suppose that there exists a hypersurface with the Newton polytope $\Delta$, which passes through a given set of subvarieties. Using tropical geometry, we associate a subset of $\Delta$ to each of these subvarieties. We prove that a weighted…

In a metric space, the Fermat-Weber points of a sample are statistics to measure the central tendency of the sample and it is well-known that the Fermat-Weber point of a sample is not necessarily unique in the metric space. We investigate…

We provide two complexity measures that can be used to measure the running time of algorithms to compute multiplications of long integers. The random access machine with unit or logarithmic cost is not adequate for measuring the complexity…

In this note, we propose a novel technique to reduce the algorithmic complexity of neural network training by using matrices of tropical real numbers instead of matrices of real numbers. Since the tropical arithmetics replaces…

In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra.…

The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…

The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion form. We introduce a general scaling…

Weighted automata over the max-plus semiring S are closely related to finitely generated semigroups of matrices over S. In this paper, we use results in automata theory to study two quantities associated with sets of matrices: the joint…

Let $\mathbf{v}_1,\ldots,\mathbf{v}_m$ be points in a metric space with distance $d$, and let $w_1,\ldots,w_m$ be positive real weights. The weighted Fermat-Weber points are those points $\mathbf{x}$ which minimize $\sum w_i d(\mathbf{v}_i,…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects…

We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the…

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…

A classical theorem of Macbeath states that for any integers $d \geq 2$, $n \geq d+1$, $d$-dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with $n$ vertices. In this paper…