Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

Vincent Neiger, Hamid Rahkooy, Éric Schost

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

1 Downloads (Pure)

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 of the annihilator of one or several such sequences.
Original languageEnglish
Title of host publication19th International Workshop on Computer Algebra in Scientific Computing
PublisherSpringer
Publication date2017
Pages313-328
ISBN (Print)9783319663197
DOIs
Publication statusPublished - 2017
Event19th International Workshop on Computer Algebra in Scientific Computing - AMSS South Building, Beijing, China
Duration: 18 Sep 201722 Sep 2017

Conference

Conference19th International Workshop on Computer Algebra in Scientific Computing
LocationAMSS South Building
CountryChina
CityBeijing
Period18/09/201722/09/2017
SeriesLecture Notes in Computer Science
Volume10490
ISSN0302-9743

Fingerprint Dive into the research topics of 'Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences'. Together they form a unique fingerprint.

Cite this