2000 character limit reached
Algorithms for zero-dimensional ideals using linear recurrent sequences
Published 6 Jul 2017 in cs.SC | (1707.01971v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.