Related papers: Tropical Geometry and Mechanism Design
We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful…
In this article, we present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of finite symmetries. We compute the tropical Grassmannian TGr$_0(3,8)$, and show that it refines the…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
Weighted Finite State Transducers (WFSTs) are versatile data structures that can model a great number of problems, ranging from Automatic Speech Recognition to DNA sequencing. Traditional computer science algorithms are employed when…
This work uncovers the tropical analogue for measured laminations of the convex hull construction of decorated Teichmueller theory, namely, it is a study in coordinates of geometric degeneration to a point of Thurston's boundary for…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…
A new multidimensional optimization problem is considered in the tropical mathematics setting. The problem is to minimize a nonlinear function defined on a finite-dimensional semimodule over an idempotent semifield and given by a conjugate…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We apply tropical geometry to study matrix algebras over a field with valuation. Using the shapes of min-max convexity, known as polytropes, we revisit the graduated orders introduced by Plesken and Zassenhaus. These are classified by the…
Tropicalizations form a bridge between algebraic and convex geometry. We generalize basic results from tropical geometry which are well-known for special ground fields to arbitrary non-archimedean valued fields. To achieve this, we develop…
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…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…
We describe a new method for computing tropical linear spaces and more general duals of polyhedral subdivisions. It is based on Ganter's algorithm (1984) for finite closure systems.
We study tropical line arrangements associated to a three-regular graph $G$ that we refer to as \emph{tropical graph curves}. Roughly speaking, the tropical graph curve associated to $G$, whose genus is $g$, is an arrangement of $2g-2$…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
In this paper, we consider a new class of generalized Convex structure and we investigate their tropical limits. Some properties are pointing out such that translation homotheticity and others ones allowing to consider the case of discrete…
Since the first famous correspondence theorem by Mikhalkin appeared in 2005, tropical geometry has allowed a parallel treatment of real and complex counting problems. A prime example are the genus 0 Gromov-Witten invariants of the plane…
We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities). The heart of the tropical algorithm is…
The purpose of this survey is to summarize known results about tropical hypersurfaces and the Cayley Trick from polyhedral geometry. This allows for a systematic study of arrangements of tropical hypersurfaces and, in particular,…