Related papers: Tropical Convex Hull Computations
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…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
As a new concept tropical halfspaces are introduced to the (linear algebraic) geometry of the tropical semiring (R,min,+). This yields exterior descriptions of the tropical polytopes that were recently studied by Develin and Sturmfels in a…
Describing the combinatorial structure of the tropical complex $C$ of a tropical matroid polytope, we obtain a formula for the coarse types of the maximal cells of $C$. Due to the connection between tropical complexes and resolutions of…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
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…
We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring.…
In this paper we further develop the theory of geometric tropicalization due to Hacking, Keel and Tevelev and we describe tropical methods for implicitization of surfaces. More precisely, we enrich this theory with a combinatorial formula…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
The algebraic foundation of tropical polynomial algebra provides the framework for the geometric construction of the supplement and the reversal of tropical varieties, thereby inducing a duality of reduced tropical varieties; for classes of…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
In tropical algebraic geometry, the solution sets of polynomial equations are piecewise-linear. We introduce the tropical variety of a polynomial ideal, and we identify it with a polyhedral subcomplex of the Grobner fan. The tropical…
We define the tropical moduli space of covers of a tropical line in the plane as weighted abstract polyhedral complex, and the tropical branch map recording the images of the simple ramifications. Our main result is the invariance of the…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
We introduce and study a special class of ideals, called tropical ideals, in the semiring of tropical polynomials, with the goal of developing a useful and solid algebraic foundation for tropical geometry. The class of tropical ideals…
We introduce tropical Newton-Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton-Puiseux polynomial. A polynomial complexity algorithm for resolubility of a…