Related papers: Computing zero-dimensional tropical varieties via …
We introduce a simple, easy to implement, and computationally efficient tropical convolutional neural network architecture that is robust against adversarial attacks. We exploit the tropical nature of piece-wise linear neural networks by…
We present an algorithm to compute all $n$ nondominated points of a multicriteria discrete optimization problem with $d$ objectives using at most $\mathcal{O}(n^{\lfloor d/2 \rfloor})$ scalarizations. The method is similar to algorithms by…
Block and G\"ottsche introduced a Laurent polynomial multiplicity to count tropical curves. Itenberg and Mikhalkin then showed that this multiplicity leads to invariant counts called tropical refined invariants. Recently, Brugall\'e and…
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-…
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…
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 introduce the concept of multiplication matrices for ideals of projective dimension zero. We discuss various applications and in particular, we give a new algorithm to compute the variety of an ideal of projective dimension zero.
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
For a non-singular projective toric variety $X$, the virtual logarithmic Tevelev degrees are defined as the virtual degree of the morphism from the moduli stack of logarithmic stable maps $\overline{\mathcal{M}}_{\mathsf{\Gamma}}(X)$ to the…
Solving zero-dimensional polynomial systems using Gr\"obner bases is usually done by, first, computing a Gr\"obner basis for the degree reverse lexicographic order, and next computing the lexicographic Gr\"obner basis with a change of order…
Based on a description of project networks by max-plus algebra and poset, the adjacency of critical paths is presented using tropical geometry.
When we apply comparative phylogenetic analyses to genome data, it is a well-known problem and challenge that some of given species (or taxa) often have missing genes. In such a case, we have to impute a missing part of a gene tree from a…
We express the reduction types of Picard curves in terms of tropical invariants associated to binary quintics. We also give a general framework for tropical invariants associated to group actions on arbitrary varieties. The problem of…
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…
In this article we introduce the recently developed polymake extension TropicalQuarticCurves and its associated database entry in polyDB dealing with smooth tropical quartic curves. We report on algorithms implemented to analyze tropical…
We define the tropical moduli space of covers of a tropical line in the plane as weighted abstract polyhedral complex, and the tropical branch map recording the images of the simple ramifications. Our main result is the invariance of the…
The paper focuses on a multidimensional optimization problem, which is formulated in terms of tropical mathematics and consists in minimizing a nonlinear objective function subject to linear inequality constraints. To solve the problem, 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…
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…