Algorithms for zero-dimensional ideals using linear recurrent sequences
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.
Domains
Symbolic Computation [cs.SC]| Origin | Files produced by the author(s) |
|---|
Loading...