Related papers: The tropical discriminant of a polynomial map on a…
We study normal directions to facets of the Newton polytope of the discriminant of the Laurent polynomial system via the tropical approach. We use the combinatorial construction proposed by Dickenstein, Feichtner and Sturmfels for the…
We study singularities in tropical hypersurfaces defined by a valuation over a field of positive characteristic. We provide a method to compute the set of singular points of a tropical hypersurface in positive characteristic and the p-adic…
In this paper we compute the Newton polytope $\mathcal M_A$ of the Morse discriminant in the space of univariate polynomials with the given support set $A.$ Namely, we establish a surjection between the set of all combinatorial types of…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
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 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.
In a previous paper, we announced a formula to compute Gromov-Witten and Welschinger invariants of some toric varieties, in terms of combinatorial objects called floor diagrams. We give here detailed proofs in the tropical geometry…
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…
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…
A polyhedral method to solve a system of polynomial equations exploits its sparse structure via the Newton polytopes of the polynomials. We propose a hybrid symbolic-numeric method to compute a Puiseux series expansion for every space curve…
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…
Tropical geometry is used to develop a new approach to the theory of discriminants and resultants in the sense of Gel'fand, Kapranov and Zelevinsky. The tropical A-discriminant, which is the tropicalization of the dual variety of the…
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…
We explore the concept of real tropical basis of an ideal in the field of real Puiseux series. We show explicit tropical bases of zero-dimensional real radical ideals, linear ideals and hypersurfaces coming from combinatorial patchworking.…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
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…
Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients.…
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.…
Let ${\mathcal D}^{k,l}(m,n)$ be the set of all the integer points in the transportation polytope of $kn\times ln$ matrices with row sums $lm$ and column sums $km$. In this paper we find the sharp lower bound on the tropical determinant…