用线性递归序列求零维理想的算法
Algorithms for zero-dimensional ideals using linear recurrent sequences
摘要：
受Faugère和Mou的稀疏FGLM算法的启发，我们展示了如何使用线性递归多维序列可以允许一个执行操作，如理想的主分解，通过计算一个或多个这样的序列的零化子。
英文摘要：
Inspired by Faugère and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such sequences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
