Related papers: On Affine Tropical F5 Algorithms

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

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…

Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…

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…

We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…

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 investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…

This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…

We generalize to the super context, the known fact that if an affine algebraic group $G$ over a commutative ring $k$ acts freely (in an appropriate sense) on an affine scheme $X$ over $k$, then the dur sheaf $X\tilde{\tilde{/}}G$ of…

Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the…

Let $K$ be a field which is complete for a discrete valuation. We prove a logarithmic version of the N\'eron-Ogg-Shafarevich criterion: if $A$ is an abelian variety over $K$ which is cohomologically tame, then $A$ has good reduction in the…

A tropical (or min-plus) semiring is a set $\mathbb{Z}$ (or $\mathbb{Z \cup \{\infty\}}$) endowed with two operations: $\oplus$, which is just usual minimum, and $\odot$, which is usual addition. In tropical algebra the vector $x$ is a…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

Let $I$ be an ideal of the ring of Laurent polynomials $K[x_1^{\pm1},\ldots,x_n^{\pm1}]$ with coefficients in a real-valued field $(K,v)$. The fundamental theorem of tropical algebraic geometry states the equality…

Tropical geometry has recently found several applications in the analysis of neural networks with piecewise linear activation functions. This paper presents a new look at the problem of tropical polynomial division and its application to…

The tropical semiring is an algebraic system with addition ``$\max$'' and multiplication ``$+$''. As well as in conventional algebra, linear programming in the tropical semiring has been developed. In this study, we introduce a new type of…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

We provide a self-contained introduction to Gr\"obner bases of submodules of $R[x_1, \ldots, x_n]^k$, where $R$ is a Euclidean domain, and explain how to use these bases to solve linear systems over $R[x_1, \ldots, x_n]$.

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…