Related papers: Polynomial complexity recognizing a tropical linea…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…

Tropical polyhedra seem to play a central role in static analysis of softwares. These tropical geometrical objects play also a central role in parity games especially mean payoff games and energy games. And determining if an initial state…

We define arroids as an abstract axiom set encoding the intersection properties of arrangements of curves. The tropicalization of the complement of arrangement of curves meeting pairwise transversely is shown to be determined by the…

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…

We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…

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…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We study the class of real-valued functions on convex subsets of R^n which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be…

We examine the topological characteristic cohomology classes of complexified vector bundles. In particular, all the classes coming from the real vector bundles underlying the complexification are determined.

We use piecewise polynomials to define tropical cocycles generalising the well-known notion of tropical Cartier divisors to higher codimensions. Groups of cocycles are tropical analogues of Chow cohomology groups. We also introduce an…

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

Tropical counting tools are useful for many enumerative questions. We count tropical multinodal surfaces using floor plans, looking at the case when two nodes are tropically close together, i.e., unseparated. We generalize tropical floor…

We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent…

Tropical varieties are polyhedral shadows of classical varieties. The purpose of these expository notes is to explain the origin of this polyhedral complex structure from the perspective of Gr\"obner bases. To appear in the proceedings of…

In this paper, we investigate tropical secant varieties of ordinary linear spaces. These correspond to the log-limit sets of ordinary toric varieties; we show that their interesting parts are combinatorially isomorphic to a certain natural…

We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…

Computing layer similarities is an important way of characterizing multiplex networks because various static properties and dynamic processes depend on the relationships between layers. We provide a taxonomy and experimental evaluation of…

In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…

We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…