Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

Vincent Neiger; Hamid Rahkooy; Éric Schost

doi:10.1007/978-3-319-66320-3_23

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

Vincent Neiger, Hamid Rahkooy, Éric Schost

University of Waterloo

Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-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 language	English
Title of host publication	19th International Workshop on Computer Algebra in Scientific Computing
Publisher	Springer
Publication date	2017
Pages	313-328
ISBN (Print)	9783319663197
DOIs	https://doi.org/10.1007/978-3-319-66320-3_23
Publication status	Published - 2017
Event	19th International Workshop on Computer Algebra in Scientific Computing - AMSS South Building, Beijing, China Duration: 18 Sept 2017 → 22 Sept 2017 Conference number: 19

Conference

Conference	19th International Workshop on Computer Algebra in Scientific Computing
Number	19
Location	AMSS South Building
Country/Territory	China
City	Beijing
Period	18/09/2017 → 22/09/2017

Series	Lecture Notes in Computer Science
Volume	10490
ISSN	0302-9743

Access to Document

10.1007/978-3-319-66320-3_23

OpenUrl availability

Full text

COFUNDPostdocDTU: COFUNDPostdocDTU
Præstrud, M. R. (Project Participant) & Brodersen, S. W. (Project Participant)
01/01/2014 → 31/12/2019
Project: Research

Cite this

@inbook{1999818bec2242a5afd7c1336b236167,

title = "Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences",

abstract = "Inspired by Faug{\'e}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.",

author = "Vincent Neiger and Hamid Rahkooy and {\'E}ric Schost",

year = "2017",

doi = "10.1007/978-3-319-66320-3_23",

language = "English",

isbn = "9783319663197",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "313--328",

booktitle = "19th International Workshop on Computer Algebra in Scientific Computing",

note = "19th International Workshop on Computer Algebra in Scientific Computing, CASC 2017 ; Conference date: 18-09-2017 Through 22-09-2017",

}

Neiger, V, Rahkooy, H & Schost, É 2017, Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. in 19th International Workshop on Computer Algebra in Scientific Computing. Springer, Lecture Notes in Computer Science, vol. 10490, pp. 313-328, 19th International Workshop on Computer Algebra in Scientific Computing, Beijing, China, 18/09/2017. https://doi.org/10.1007/978-3-319-66320-3_23

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. / Neiger, Vincent; Rahkooy, Hamid; Schost, Éric.
19th International Workshop on Computer Algebra in Scientific Computing. Springer, 2017. p. 313-328 (Lecture Notes in Computer Science, Vol. 10490).

Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

TY - CHAP

T1 - Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

AU - Neiger, Vincent

AU - Rahkooy, Hamid

AU - Schost, Éric

N1 - Conference code: 19

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-66320-3_23

DO - 10.1007/978-3-319-66320-3_23

M3 - Book chapter

SN - 9783319663197

T3 - Lecture Notes in Computer Science

SP - 313

EP - 328

BT - 19th International Workshop on Computer Algebra in Scientific Computing

PB - Springer

T2 - 19th International Workshop on Computer Algebra in Scientific Computing

Y2 - 18 September 2017 through 22 September 2017

ER -

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Projects

COFUNDPostdocDTU: COFUNDPostdocDTU

Cite this