Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions

@article{Berthomieu2022FasterCO,
  title={Faster Change of Order Algorithm for Gr{\"o}bner Bases under Shape and Stability Assumptions},
  author={J{\'e}r{\'e}my Berthomieu and Vincent Neiger and Mohab Safey El Din},
  journal={Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation},
  year={2022}
}
Solving zero-dimensional polynomial systems using Gröbner bases is usually done by, first, computing a Gröbner basis for the degree reverse lexicographic order, and next computing the lexicographic Gröbner basis with a change of order algorithm. Currently, the change of order now takes a significant part of the whole solving time for many generic instances. Like the fastest known change of order algorithms, this work focuses on the situation where the ideal defined by the system satisfies… 

Tables from this paper

Finer Complexity Estimates for the Change of Ordering of Gröbner Bases for Generic Symmetric Determinantal Ideals

TLDR
This paper focuses on the Sparse-FGLM algorithm, the state-of-the-art for changing ordering of Gröbner bases of zero-dimensional ideals, and studies its complexity for symmetric determinantal ideals under a variant of Fröberg's conjecture.

Efficient linear algebra on GPUs for Gröbner bases computations

TLDR
This work aims to compute a lexicographic Gröbner basis of the ideal spanned by f1, which generically is of the form gn = 0, xn−1 = gn−1 (xn), . . . , x1 = g1 ( xn), deggn = D.

References

SHOWING 1-10 OF 59 REFERENCES

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach

TLDR
A new Las Vegas algorithm is proposed for solving polynomial systems with a finite number of solutions by using Gröbner basis for which the change of ordering step has a sub-cubic complexity and whose total complexity is dominated by the complexity of the F5 algorithm.

Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices

TLDR
This work investigates the particular but important shape position case and obtains an implementation which is able to manipulate 0-dimensional ideals over a prime field of degree greater than 30000 and outperforms the Magma/Singular/FGb implementations of FGLM.

Finer Complexity Estimates for the Change of Ordering of Gröbner Bases for Generic Symmetric Determinantal Ideals

TLDR
This paper focuses on the Sparse-FGLM algorithm, the state-of-the-art for changing ordering of Gröbner bases of zero-dimensional ideals, and studies its complexity for symmetric determinantal ideals under a variant of Fröberg's conjecture.

A new efficient algorithm for computing Gröbner bases (F4)

Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering

TLDR
The lexicographical GroBner basis can be obtained by applying this algorithm after a total degree Grobner basis computation: it is usually much faster to compute the basis this way than with a direct application of Buchberger's algorithm.

Sparse FGLM algorithms

Normal forms for general polynomial matrices

msolve: A Library for Solving Polynomial Systems

TLDR
The practical performances of msolve are compared with leading computer algebra systems such as Magma, Maple, Singular on a wide range of systems with finitely many complex solutions, showing that msolve can tackle systems which were out of reach by the computer algebra software state-of-the-art.
...