Related papers: Computing tropical points and tropical links
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…
This paper focuses on studying the configuration spaces of graphs realised in $\mathbb C^2$, such that the configuration space is, after normalisation, one dimensional. If this is the case, then the configuration space is, generically, a…
In the tropical projective torus, it is not guaranteed that the projection of a Fermat-Weber point of a given data set is a Fermat-Weber point of the projection of the data set. In this paper, we focus on the projection on the tropical…
Finding the so-called characteristic numbers of the complex projective plane ${\mathbb C}P^2$ is a classical problem of enumerative geometry posed by Zeuthen more than a century ago. For a given $d$ and $g$ one has to find the number of…
In this note we study the relationship between ideals and congruences of the tropical polynomial and Laurent polynomial semirings. We show that the variety of a non-zero prime ideal of the tropical (Laurent) polynomial semiring consists of…
Tropical roots of tropical polynomials have been previously studied and used to localize roots of classical polynomials and eigenvalues of matrix polynomials. We extend the theory of tropical roots from tropical polynomials to tropical…
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…
We define nondegenerate tropical complete intersections imitating the corresponding definition in complex algebraic geometry. As in the complex situation, all nonzero intersection multiplicity numbers between tropical hypersurfaces defining…
We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
We consider tropical hemispaces, defined as tropically convex sets whose complements are also tropically convex, and tropical semispaces, defined as maximal tropically convex sets not containing a given point. We introduce the concept 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 present an unexpected application of tropical convexity to the determination of invariants for linear systems of differential equations. We show that the classical G\'erard-Levelt lattice saturation procedure can be geometrically…
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…
We study the combinatorial properties of 2-dimensional tropical complexes. In particular, we prove tropical analogues of the Hodge index theorem and Noether's formula. In addition, we introduce algebraic equivalence for divisors on tropical…
Tropical Differential Algebraic Geometry considers difficult or even intractable problems in Differential Equations and tries to extract information on their solutions from a restricted structure of the input. The Fundamental Theorem of…
In this paper, we survey and study definitions and properties of tropical polynomials, tropical rational functions and in general, tropical meromorphic functions, emphasizing practical techniques that can really carry out computations. For…
A net is a special configuration of lines and points in the projective plane. There are certain restrictions on the number of its lines and points. We proved that there cannot be any (4,4) nets in $\mathbb{C}P^2$. In order to show this, we…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
Tropical algebraic geometry is the geometry of the tropical semiring $(\mathbb{R},\min,+)$. Its objects are polyhedral cell complexes which behave like complex algebraic varieties. We give an introduction to this theory, with an emphasis on…