Related papers: Computing complex and real tropical curves using m…
We show how tropical varieties of ideals I over a field K with non-trivial valuation can be traced back to tropical varieties of ideals in R[[t]][x] over some dense subring R in its ring of integers. Moreover, for homogeneous ideals, we…
Let $X$ be an algebraic variety and let $S$ be a tropical variety associated to $X$. We study the tropicalization map from the moduli space of stable maps into $X$ to the moduli space of tropical curves in $S$. We prove that it is a…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
We find a relation between mixed volumes of several polytopes and the convex hull of their union, deducing it from the following fact: the mixed volume of a collection of polytopes only depends on the product of their support functions…
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…
An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…
For a convenient and Newton non-degenerate singularity, the Milnor number is computed from the complement of its Newton diagram in the first quadrant, so-called Kouchnirenko's formula. In this paper, we consider tropical curves dual to…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…
The aim of this paper is to give a constructive proof of one of the basic theorems of tropical geometry: given a point on a tropical variety (defined using initial ideals), there exists a Puiseux-valued ``lift'' of this point in the…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When…
The discriminant of a polynomial map is central to problems from affine geometry and singularity theory. Standard methods for characterizing it rely on elimination techniques that can often be ineffective. This paper concerns polynomial…
The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls.…
A graph profile records all possible densities of a fixed finite set of graphs. Profiles can be extremely complicated; for instance the full profile of any triple of connected graphs is not known, and little is known about hypergraph…
The motivic nearby fiber is an invariant obtained from degenerating a complex variety over a disc. It specializes to the Euler characteristic of the original variety but also contains information on the variation of Hodge structure…
We present two effective tools for computing the positive tropicalization of algebraic varieties. First, we outline conditions under which the initial ideal can be used to compute the positive tropicalization, offering a real analogue to…
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…
Hurwitz numbers count covers of curves satisfying fixed ramification data. Via monodromy representation, this counting problem can be transformed to a problem of counting factorizations in the symmetric group. This and other beautiful…