Related papers: Tropical Convexity via Cellular Resolutions
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…
An arrangement of finitely many tropical hyperplanes in the tropical torus leads to a notion of `type' data for points, with the underlying unlabeled arrangement giving rise to `coarse type'. It is shown that the decomposition of 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…
In this paper we focus on the tropical convex hull of convex sets and polyhedral complexes. We give a vertex description of the tropical convex hull of a line segment and a ray. %in \RR^{n+1}/\RR\mathbf{1}. Next we show that tropical convex…
The notion of convexity in tropical geometry is closely related to notions of convexity in the theory of affine buildings. We explore this relationship from a combinatorial and computational perspective. Our results include a convex hull…
Tropical polytopes are images of polytopes in an affine space over the Puiseux series field under the degree map. This viewpoint gives rise to a family of cellular resolutions of monomial ideals which generalize the hull complex of Bayer…
Tropical mathematics redefines the rules of arithmetic by replacing addition with taking a maximum, and by replacing multiplication with addition. After briefly discussing a tropical version of linear algebra, we study polynomials build…
In classical geometry, a linear space is a space that is closed under linear combinations. In tropical geometry, it has long been a consensus that tropical varieties defined by valuated matroids are the tropical analogue of linear spaces.…
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 give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…
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…
We develop a novel framework to construct and analyze finite valued, multidimensional mechanisms using tropical convex geometry. We geometrically characterize incentive compatibility using cells in the tropical convex hull of the type set.…
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…
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…
We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent…
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…