Faster change of order algorithm for Gröbner bases under shape and stability assumptions

by   Jérémy Berthomieu, et al.

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 natural properties which can be recovered in generic coordinates. First, the ideal has a shape lexicographic Gröbner basis. Second, the set of leading terms with respect to the degree reverse lexicographic order has a stability property; in particular, the multiplication matrix can be read on the input Gröbner basis. The current fastest algorithms rely on the sparsity of this matrix. Actually, this sparsity is a consequence of an algebraic structure, which can be exploited to represent the matrix concisely as a univariate polynomial matrix. We show that the Hermite normal form of that matrix yields the sought lexicographic Gröbner basis, under assumptions which cover the shape position case. Under some mild assumption implying n ≤ t, the arithmetic complexity of our algorithm is O(t^ω-1D), where n is the number of variables, t is a sparsity indicator of the aforementioned matrix, D is the degree of the zero-dimensional ideal under consideration, and ω is the exponent of matrix multiplication. This improves upon both state-of-the-art complexity bounds O(tD^2) and O(D^ω), since ω < 3 and t≤ D. Practical experiments, based on the libraries msolve and PML, confirm the high practical benefit.


page 1

page 2

page 3

page 4


Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems

We consider ideals involving the maximal minors of a polynomial matrix. ...

Computing syzygies in finite dimension using fast linear algebra

We consider the computation of syzygies of multivariate polynomials in a...

Computing Canonical Bases of Modules of Univariate Relations

We study the computation of canonical bases of sets of univariate relati...

Solving parametric systems of polynomial equations over the reals through Hermite matrices

We design a new algorithm for solving parametric systems having finitely...

On the p-adic stability of the FGLM algorithm

Nowadays, many strategies to solve polynomial systems use the computatio...

Block-Krylov techniques in the context of sparse-FGLM algorithms

Consider a zero-dimensional ideal I in K[X_1,...,X_n]. Inspired by Faugè...

Fast computation of approximant bases in canonical form

In this article, we design fast algorithms for the computation of approx...

Please sign up or login with your details

Forgot password? Click here to reset