Related papers: Tropical Implicitization Revisited
We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.
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…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
Tropical algebraic geometry offers new tools for elimination theory and implicitization. We determine the tropicalization of the image of a subvariety of an algebraic torus under any homomorphism from that torus to another torus.
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…
A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…
Tropicalization is a procedure that assigns polyhedral complexes to algebraic subvarieties of a torus. If one fixes a weighted polyhedral complex, one may study the set of all subvarieties of a toric variety that have that complex as their…
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…
We address the description of the tropicalization of families of rational varieties under parametrizations with prescribed support, via curve valuations. We recover and extend results by Sturmfels, Tevelev and Yu for generic coefficients,…
We present algorithms for computing zero-dimensional tropical varieties as implemented in OscarZerodimensionalTropicalization.jl. The algorithms include a mathematical workaround for a common practical issue arising when working with…
The tropicalization of a linear space over a non-archimedean field is a tropical linear space. In this paper, we present a method for computing the tropicalization of any lattice over a valuation ring. The resulting tropical semimodule is…
The concepts of tropical-semiring and tropical hypersurface, are extended for an arbitrary ordered group. Then, we define the tropicalization of a polynomial with coefficients in a Krull-valued field. After a close study of the properties…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
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.…
Tropicalization is a procedure for associating a polyhedral complex in Euclidean space to a subvariety of an algebraic torus. We study the question of which graphs arise from tropicalizing algebraic curves. By using Baker's specialization…
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…
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…
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…
We consider the tropicalization of tangent lines to a complete intersection curve $X$ in $\mathbb{P}^n$. Under mild hypotheses, we describe a procedure for computing the tropicalization of the image of the Gauss map of $X$ in terms of the…
Given a curve defined over an algebraically closed field which is complete with respect to a nontrivial valuation, we study its tropical Jacobian. This is done by first tropicalizing the curve, and then computing the Jacobian of the…