Related papers: The tropical discriminant in positive characterist…
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…
We consider the question of when points in tropical affine space uniquely determine a tropical hypersurface. We introduce a notion of multiplicity of points so that this question may be meaningful even if some of the points coincide. We…
We study the notion of singular tropical hypersurfaces of any dimension. We characterize the singular points in terms of tropical Euler derivatives and we give an algorithm to compute all singular points. We also describe non-transversal…
In this paper, we study tropicalisations of singular surfaces in toric threefolds. We completely classify singular tropical surfaces of maximal-dimensional type, show that they can generically have only finitely many singular points, and…
We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant…
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.…
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 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 reconcile the discrepancy between the complex and tropical counts of some enumerative problems reducing to positive characteristic. Each problem that we consider suggests a prime with special behaviour. Modulo this prime, the solutions…
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 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 present a simple and elementary procedure to sketch the tropical conic given by a degree--two homogeneous tropical polynomial. These conics are trees of a very particular kind. Given such a tree, we explain how to compute a defining…
The number of positive solutions of a system of two polynomials in two variables defined in the field of real numbers with a total of five distinct monomials cannot exceed 15. All previously known examples have at most 5 positive solutions.…
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…
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on…
In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call `tropical polynomials' and `sign polynomials', respectively. We classify all irreducible polynomials in either case. We…
In this work, we explore the relation between the tropicalization of a real semi-algebraic set $S = \{ f_1 < 0, \dots , f_k < 0\}$ defined in the positive orthant and the combinatorial properties of the defining polynomials $f_1, \dots,…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
We fix the supports A=(A_1,...,A_k) of a list of tropical polynomials and define the tropical resultant TR(A) to be the set of choices of coefficients such that the tropical polynomials have a common solution. We prove that TR(A) is the…
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…