7 research outputs found
Matrix-F5 algorithms over finite-precision complete discrete valuation fields
Let be a sequence
of homogeneous polynomials with -adic coefficients. Such system may happen,
for example, in arithmetic geometry. Yet, since is not an
effective field, classical algorithm does not apply.We provide a definition for
an approximate Gr{\"o}bner basis with respect to a monomial order We
design a strategy to compute such a basis, when precision is enough and under
the assumption that the input sequence is regular and the ideals are weakly--ideals. The conjecture of Moreno-Socias
states that for the grevlex ordering, such sequences are generic.Two variants
of that strategy are available, depending on whether one lean more on precision
or time-complexity. For the analysis of these algorithms, we study the loss of
precision of the Gauss row-echelon algorithm, and apply it to an adapted
Matrix-F5 algorithm. Numerical examples are provided.Moreover, the fact that
under such hypotheses, Gr{\"o}bner bases can be computed stably has many
applications. Firstly, the mapping sending to the reduced
Gr{\"o}bner basis of the ideal they span is differentiable, and its
differential can be given explicitly. Secondly, these hypotheses allows to
perform lifting on the Grobner bases, from to
or Finally, asking for the same
hypotheses on the highest-degree homogeneous components of the entry
polynomials allows to extend our strategy to the affine case
Matrix-F5 algorithms over finite-precision complete discrete valuation fields
International audienceLet be a sequence of homogeneous polynomials with -adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since is not an effective field, classical algorithm does not apply.We provide a definition for an approximate Gröbner basis with respect to a monomial order We design a strategy to compute such a basis, when precision is enough and under the assumption that the input sequence is regular and the ideals are weakly--ideals. The conjecture of Moreno-Socias states that for the grevlex ordering, such sequences are generic.Two variants of that strategy are available, depending on whether one lean more on precision or time-complexity. For the analysis of these algorithms, we study the loss of precision of the Gauss row-echelon algorithm, and apply it to an adapted Matrix-F5 algorithm. Numerical examples are provided.Moreover, the fact that under such hypotheses, Gröbner bases can be computed stably has many applications. Firstly, the mapping sending to the reduced Gröbner basis of the ideal they span is differentiable, and its differential can be given explicitly. Secondly, these hypotheses allows to perform lifting on the Grobner bases, from to or Finally, asking for the same hypotheses on the highest-degree homogeneous components of the entry polynomials allows to extend our strategy to the affine case
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
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
Tracking p-adic precision
We present a new method to propagate -adic precision in computations,
which also applies to other ultrametric fields. We illustrate it with many
examples and give a toy application to the stable computation of the SOMOS 4
sequence
On the p-adic stability of the FGLM algorithm
Nowadays, many strategies to solve polynomial systems use the computation of a Gröbner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gröbner basis for the lexicographical ordering. The change of ordering algorithm is crucial for these strategies. We study the p-adic stability of the main change of ordering algorithm, FGLM. We show that FGLM is stable and give explicit upper bound on the loss of precision occuring in its execution. The variant of FGLM designed to pass from the grevlex ordering to a Gröbner basis in shape position is also stable. Our study relies on the application of Smith Normal Form computations for linear algebra