Journal of Complexity ( IF 1.8 ) Pub Date : 2020-06-17 , DOI: 10.1016/j.jco.2020.101502 Vincent Neiger , Éric Schost
We consider the computation of syzygies of multivariate polynomials in a finite-dimensional setting: for a -module of finite dimension as a -vector space, and given elements in , the problem is to compute syzygies between the ’s, that is, polynomials in such that in . Assuming that the multiplication matrices of the 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 operations in the base field , where is the exponent of matrix multiplication. Furthermore, assuming that is itself given as , 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 , and 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 .
中文翻译:
使用快速线性代数计算有限维上的合音
我们考虑在有限维设置中计算多元多项式的合酶: -模块 有限尺寸的 作为一个 -向量空间和给定元素 在 ,问题是要计算 是多项式 在 这样 在 。假设的乘法矩阵 关于某些基础的变量 众所周知,我们给出了一种算法,该算法针对任何单项式,使用以下公式计算这些syygies模块的简化Gröbner基础 基本字段中的操作 ,在哪里 是矩阵乘法的指数。此外,假设 本身给出为 ,在某些假设下 我们证明了这些乘法矩阵可以从Gröbner的基础上计算 在相同的复杂度范围内。特别是, 和 在 ,这会沿FGLM算法的路线产生单项顺序算法的变化,其复杂度范围在 。