Related papers: Matrix-F5 algorithms and tropical Gr\"obner bases …
We define a formal framework for the study of algebras of type Max-plus, Min-Plus, tropical algebras, and more generally algebras over a commutative idempotent semi-field. This work is motivated by the increasingly diversified use of these…
We use tropical algebras as platforms for a very efficient digital signature protocol. Security relies on computational hardness of factoring one-variable tropical polynomials; this problem is known to be NP-hard.
This paper is the third installment in a series of papers devoted to the computation of enumerative invariants of abelian surfaces through the tropical approach. We develop a pearl diagram algorithm similar to the floor diagram algorithm…
Mixed-precision computations are a hallmark of the current stage of AI, driving the progress in large language models towards efficient, locally deployable solutions. This article addresses the floating-point computation of…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
Can algebraic geometry enhance the sharpness, robustness, and interpretability of modern neural reasoning models by equipping them with a mathematically grounded inductive bias? To answer this, we introduce Tropical Attention, an attention…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to…
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…
Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…
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…
In this paper, we present methods for solving a system of linear equations, $ AX=b $, over tropical semirings. To this end, if possible, we first reduce the order of the system through some row-column analysis, and obtain a new system with…
In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
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…
In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…
We introduce tropical Newton-Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton-Puiseux polynomial. A polynomial complexity algorithm for resolubility of a…
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few…
This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…