A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension

Abstract

Let $f_1,\dots ,f_m$ be elements in a quotient $R^n/N$ which has finite dimension as a $K$-vector space, where $R=K[X_1,\dots ,X_r]$ and $N$ is an $R$-submodule of $R^n$. We address the problem of computing a Gröbner basis of the module of syzygies of $(f_1,\dots ,f_m)$, that is, of vectors $(p_1,\dots ,p_m)\in R^m$ such that $p_1{f}_1+\cdots +p_m{f}_m=0$. An iterative algorithm for this problem was given by Marinari, Möller, and Mora (1993) using a dual representation of $R^n/N$ as the kernel of a collection of linear functionals. Following this viewpoint, we design a divide-and-conquer algorithm, which can be interpreted as a generalization to several variables of Beckermann and Labahn's recursive approach for matrix Padé and rational interpolation problems. To highlight the interest of this method, we focus on the specific case of bivariate Padé approximation and show that it improves upon the best known complexity bounds.

ISSAC 2020. 8 pages, 4 algorithms