Algorithms for zero-dimensional ideals using linear recurrent sequences
classification
💻 cs.SC
keywords
sequenceslinearrecurrentalgorithmalgorithmsallowannihilatorcomputing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.