On Affine Tropical F5 Algorithms
From MaRDI portal
Publication:5120220
Abstract: Let be a field equipped with a valuation. Tropical varieties over can be defined with a theory of Gr{"o}bner bases taking into account the valuation of .Because of the use of the valuation, the theory of tropical Gr{"o}bner bases has proved to provide settings for computations over polynomial rings over a -adic field that are more stable than that of classical Gr{"o}bner bases.Beforehand, these strategies were only available for homogeneous polynomials. In this article, we extend the F5 strategy to a new definition of tropical Gr{"o}bner bases in an affine setting.We provide numerical examples to illustrate time-complexity and -adic stability of this tropical F5 algorithm.We also illustrate its merits as a first step before an FGLM algorithm to compute (classical) lex bases over -adics.
Recommendations
- On affine tropical F5 algorithms
- A tropical F5 algorithm
- On FGLM algorithms with tropical Gröbner bases
- Tropicalizing the simplex algorithm
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Computer algebra methods in tropical geometry
- New algorithms for solving tropical linear systems
- Tropical Convex Hull Computations
Cited in
(6)
This page was built for publication: On Affine Tropical F5 Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120220)