Algorithms for zero-dimensional ideals using linear recurrent sequences
Symbolic Computation
2017-07-10 v1
Abstract
Inspired by Faug\`ere 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.
Cite
@article{arxiv.1707.01971,
title = {Algorithms for zero-dimensional ideals using linear recurrent sequences},
author = {Vincent Neiger and Hamid Rahkooy and Éric Schost},
journal= {arXiv preprint arXiv:1707.01971},
year = {2017}
}
Comments
LNCS, Computer Algebra in Scientific Computing CASC 2017