Algorithms for zero-dimensional ideals using linear recurrent sequences
arXiv:1707.01971
Abstract
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.
LNCS, Computer Algebra in Scientific Computing CASC 2017