Algorithms for zero-dimensional ideals using linear recurrent sequences

07/06/2017
by   Vincent Neiger, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset