关于计算互极大行列式理想的Gröbner基的算术复杂度
On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
AI总结:
本文研究计算互极大行列式理想的Gröbner基的算术复杂度,通过分析反字典序理想的约化Gröbner基规模,为DetGB算法建立了零维情形下的渐近下界与上界。
摘要:
设 $M$ 为域 $\Bbbk$ 上的 $n\times n$ 齐次线性形式矩阵。若由 $n-1$ 阶子式生成的理想 $\mathcal{I}_{n-2}(M)$ 是Cohen-Macaulay的,则Gulliksen-Negård复形是 $\mathcal{I}_{n-2}(M)$ 的一个自由消解。最近的研究表明,通过利用从该复形可获得的 $\mathcal{I}_{n-2}(M)$ 的合冲模,可以导出一个精化的基于签名的Gröbner基算法DetGB,该算法在计算 $\mathcal{I}_{n-2}(M)$ 的grevlex Gröbner基时避免了归零约化。本文建立了DetGB的精确复杂度界。为此,我们证明了关于反字典序理想的约化grevlex Gröbner基规模的若干结果,并由此得到两个主要复杂度结论,它们依赖于与Fröberg猜想类似的猜想。第一个结论指出,在零维情形下,$\mathcal{I}_{n-2}(M)$ 的约化grevlex Gröbner基的规模渐近下界为 $n^{6}$。第二个结论同样在零维情形下指出,DetGB的复杂度渐近上界为 $n^{2ω+3}$,其中 $2\leω\le 3$ 是 $\Bbbk$ 上矩阵乘法的任意复杂度指数。
英文摘要:
Let $M$ be an $n\times n$ matrix of homogeneous linear forms over a field $\Bbbk$. If the ideal $\mathcal{I}_{n-2}(M)$ generated by minors of size $n-1$ is Cohen-Macaulay, then the Gulliksen-Negård complex is a free resolution of $\mathcal{I}_{n-2}(M)$. It has recently been shown that by taking into account the syzygy modules for $\mathcal{I}_{n-2}(M)$ which can be obtained from this complex, one can derive a refined signature-based Gröbner basis algorithm DetGB which avoids reductions to zero when computing a grevlex Gröbner basis for $\mathcal{I}_{n-2}(M)$. In this paper, we establish sharp complexity bounds on DetGB. To accomplish this, we prove several results on the sizes of reduced grevlex Gröbner bases of reverse lexicographic ideals, thanks to which we obtain two main complexity results which rely on conjectures similar to that of Fröberg. The first one states that, in the zero-dimensional case, the size of the reduced grevlex Gröbner basis of $\mathcal{I}_{n-2}(M)$ is bounded from below by $n^{6}$ asymptotically. The second, also in the zero-dimensional case, states that the complexity of DetGB is bounded from above by $n^{2ω+3}$ asymptotically, where $2\leω\le 3$ is any complexity exponent for matrix multiplication over $\Bbbk$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。