Computing syzygies in finite dimension using fast linear algebra

12/04/2019
βˆ™
by   Vincent Neiger, et al.
βˆ™
0
βˆ™

We consider the computation of syzygies of multivariate polynomials in a finite-dimensional setting: for a 𝕂[X_1,…,X_r]-module β„³ of finite dimension D as a 𝕂-vector space, and given elements f_1,…,f_m in β„³, the problem is to compute syzygies between the f_i's, that is, polynomials (p_1,…,p_m) in 𝕂[X_1,…,X_r]^m such that p_1 f_1 + … + p_m f_m = 0 in β„³. Assuming that the multiplication matrices of the r variables with respect to some basis of β„³ are known, we give an algorithm which computes the reduced GrΓΆbner basis of the module of these syzygies, for any monomial order, using O(m D^Ο‰-1 + r D^Ο‰log(D)) operations in the base field 𝕂, where Ο‰ is the exponent of matrix multiplication. Furthermore, assuming that β„³ is itself given as β„³ = 𝕂[X_1,…,X_r]^n/𝒩, under some assumptions on 𝒩 we show that these multiplication matrices can be computed from a GrΓΆbner basis of 𝒩 within the same complexity bound. In particular, taking n=1, m=1 and f_1=1 in β„³, this yields a change of monomial order algorithm along the lines of the FGLM algorithm with a complexity bound which is sub-cubic in D.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset