A tropical F5 algorithm
From MaRDI portal
Abstract: Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{"o}bner bases taking into account the valuation of K. While generalizing the classical theory of Gr{"o}bner bases, it is not clear how modern algorithms for computing Gr{"o}bner bases can be adapted to the tropical case. Among them, one of the most efficient is the celebrated F5 Algorithm of Faug{`e}re. In this article, we prove that, for homogeneous ideals, it can be adapted to the tropical case. We prove termination and correctness. Because of the use of the valuation, the theory of tropical Gr{"o}b-ner bases is promising for stable computations over polynomial rings over a p-adic field. We provide numerical examples to illustrate time-complexity and p-adic stability of this tropical F5 algorithm.
Recommendations
Cited in
(8)- Termination of the F5 algorithm
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Computing tropical varieties over fields with valuation
- On affine tropical F5 algorithms
- On Affine Tropical F5 Algorithms
- Universal Analytic Gröbner Bases and Tropical Geometry
- Axioms for a theory of signature bases
- Computing Gröbner bases on the Weyl algebras over fields with valuations
This page was built for publication: A tropical F5 algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119971)
