Algorithms for zero-dimensional ideals using linear recurrent sequences

Vincent Neiger (1) , Hamid Rahkooy (2) , Éric Schost (2)

1 DTU Compute - Department of Applied Mathematics and Computer Science [Lyngby]
2 CS - Cheriton School of Computer Science [Waterloo]

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.

Domaines: Calcul formel [cs.SC]

Vincent Neiger, Hamid Rahkooy, Éric Schost. Algorithms for zero-dimensional ideals using linear recurrent sequences. Computer Algebra in Scientific Computing, Sep 2017, Beijing, China. ⟨10.1007/978-3-319-66320-3_23⟩. ⟨hal-01558042⟩