Related papers: Constructing polynomial systems with many positive…
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…
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…
A novel way to use SMT (Satisfiability Modulo Theories) solvers to compute the tropical prevariety (resp. equilibrium) of a polynomial system is presented. The new method is benchmarked against a naive approach that uses purely polyhedral…
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…
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…
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…
Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials…
We consider real polynomial systems $f=g=0$ in two variables where $f$ has $t\geq 3$ monomial terms and $g$ has $3$ monomials terms. We prove that the number of positive isolated solutions of such a system does not exceed $3\cdot 2^{t-2} -…
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 show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
Counts of curves in $\mathbb{P}^1\times\mathbb{P}^1$ with fixed contact order with the toric boundary and satisfying point conditions can be determined with tropical methods by Mikhalkin. If we require that our curves intersect the zero-…
Using tropical geometry one can translate problems in enumerative geometry to combinatorial problems. Thus tropical geometry is a powerful tool in enumerative geometry over the complex and real numbers. Results from $\mathbb{A}^1$-homotopy…
Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects…
Tropical geometry is a degeneration of classical geometry which loose the property of unique factorization for polynomials. In this paper we explore a structure that is known to be a semi-degeneration between the classical algebra and the…
The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
Smooth algebraic plane quartics over algebraically closed fields have 28 bitangent lines. Their tropical counterparts often have infinitely many bitangents. They are grouped into seven equivalence classes, one for each linear system…