3,174 research outputs found
A Tropical F5 algorithm
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
Matrix-F5 algorithms and tropical Gr\"obner bases computation
Let be a field equipped with a valuation. Tropical varieties over can
be defined with a theory of Gr\"obner bases taking into account the valuation
of . Because of the use of the valuation, this theory is promising for
stable computations over polynomial rings over a -adic fields.We design a
strategy to compute such tropical Gr\"obner bases by adapting the Matrix-F5
algorithm. Two variants of the Matrix-F5 algorithm, depending on how the
Macaulay matrices are built, are available to tropical computation with
respective modifications. The former is more numerically stable while the
latter is faster.Our study is performed both over any exact field with
valuation and some inexact fields like or In the latter case, we track the loss in precision,
and show that the numerical stability can compare very favorably to the case of
classical Gr\"obner bases when the valuation is non-trivial. Numerical examples
are provided
Affine Buildings and Tropical Convexity
The notion of convexity in tropical geometry is closely related to notions of
convexity in the theory of affine buildings. We explore this relationship from
a combinatorial and computational perspective. Our results include a convex
hull algorithm for the Bruhat--Tits building of SL and techniques for
computing with apartments and membranes. While the original inspiration was the
work of Dress and Terhalle in phylogenetics, and of Faltings, Kapranov, Keel
and Tevelev in algebraic geometry, our tropical algorithms will also be
applicable to problems in other fields of mathematics.Comment: 22 pages, 4 figure
Syzygies among reduction operators
We introduce the notion of syzygy for a set of reduction operators and relate
it to the notion of syzygy for presentations of algebras. We give a method for
constructing a linear basis of the space of syzygies for a set of reduction
operators. We interpret these syzygies in terms of the confluence property from
rewriting theory. This enables us to optimise the completion procedure for
reduction operators based on a criterion for detecting useless reductions. We
illustrate this criterion with an example of construction of commutative
Gr{\"o}bner basis
The Newton Polytope of the Implicit Equation
We apply tropical geometry to study the image of a map defined by Laurent
polynomials with generic coefficients. If this image is a hypersurface then our
approach gives a construction of its Newton polytope.Comment: 18 pages, 3 figure
- …