Related papers: A Tropical F5 algorithm
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 provide a new complexity bound for the computation of grevlex Gr\"obner bases in the generic zero-dimensional case, relying on Moreno-Soc\'ias' conjecture. We first formalize a property of regular sequences that implies a well-known…
Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the…
Let p be an odd prime number and K be a p-adic field. In this paper, we develop an analogue of Fontaine's theory of (phi,Gamma)-modules replacing the p-cyclotomic extension by the extension K_infty obtained by adding to K a compatible…
We show that the algebraic invariants multiplicity and depth of a graded ideal in the polynomial ring are closely connected to the fan structure of its generic tropical variety in the constant coefficient case. Generically the multiplicity…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
In this paper, second installment in a series of three, we give a correspondence theorem to relate the count of genus $g$ curves in a fixed linear system in an abelian surface to a tropical count. To do this, we relate the linear system…
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…
Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…
We present an algorithm for computing zero-dimensional tropical varieties based on triangular decomposition and Newton polygon methods. From it, we derive algorithms for computing points on and links of higher-dimensional tropical…
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…
Tropical Differential Algebraic Geometry considers difficult or even intractable problems in Differential Equations and tries to extract information on their solutions from a restricted structure of the input. The Fundamental Theorem of…
We introduce adic tropicalizations for subschemes of toric varieties as limits of Gubler models associated to polyhedral covers of the ordinary tropicalization. Our main result shows that Huber's adic analytification of a subscheme of a…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
The purpose of this article is to develop foundational techniques from logarithmic geometry in order to define a functorial tropicalization map for fine and saturated logarithmic schemes in the case of constant coefficients. Our approach…
We recall the space of seminorms discussed by Payne in \cite{P} and define a slight modification, the space of graded valuations. After explaining how these spaces relate to tropical geometry, we describe examples of graded valuations which…
The signatures of polynomials were originally introduced by Faug\`{e}re for the efficient computation of Gr\"obner bases [Fau02], and redefined by Arri-Perry [AP11] as the standard monomials modulo the module of syzygies. Since it is…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
In this paper we use the connections between tropical algebraic geometry and rigid analytic geometry in order to prove two main results. We use tropical methods to prove a theorem about the Newton polygon for convergent power series in…