Related papers: Root bounds of vertical systems using tropical geo…
The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…
A key issue in tropical geometry is the lifting of intersection points to a non-Archimedean field. Here, we ask: Where can classical intersection points of planar curves tropicalize to? An answer should have two parts: first, identifying…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…
This paper investigates the expected number of complex roots of nonlinear equations. Those equations are assumed to be analytic, and to belong to certain inner product spaces. Those spaces are then endowed with the Gaussian probability…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
This paper proposes a tropical geometry-based edge detection framework that reformulates convolution and gradient computations using min-plus and max-plus algebra. The tropical formulation emphasizes dominant intensity variations,…
The index coding problem has been generalized recently to accommodate receivers which demand functions of messages and which possess functions of messages. The connections between index coding and matroid theory have been well studied in…
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
In this paper we propose a general functorial definition of the operation of \emph{local tropicalization} in commutative algebra. Let $R$ be a commutative ring, $\Gamma$ a finitely generated subsemigroup of a lattice, $\gamma : \Gamma…
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…
In this paper we construct a tropical moduli space parametrizing roots of divisors on tropical curves. We study the relation between this space and the skeleton of Jarvis moduli space of nets of limit roots on stable curves. We show that…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
In this paper we try to look at the compactification of Teichmuller spaces from a tropical viewpoint. We describe a general construction for the compactification of algebraic varieties, using their amoebas, and we describe the boundary via…
We consider multidimensional optimization problems, which are formulated and solved in terms of tropical mathematics. The problems are to minimize (maximize) a linear or nonlinear function defined on vectors over an idempotent semifield,…
We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…