Projects per year
Abstract
Inspired by Faugére and Mou´s sparse FGLM algorithm, we show how using linear recurrent multidimensional 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  313328 
ISBN (Print)  9783319663197 
DOIs  
Publication status  Published  2017 
Event  19th International Workshop on Computer Algebra in Scientific Computing  AMSS South Building, Beijing, China Duration: 18 Sep 2017 → 22 Sep 2017 
Conference
Conference  19th International Workshop on Computer Algebra in Scientific Computing 

Location  AMSS South Building 
Country  China 
City  Beijing 
Period  18/09/2017 → 22/09/2017 
Series  Lecture Notes in Computer Science 

Volume  10490 
ISSN  03029743 
Fingerprint Dive into the research topics of 'Algorithms for ZeroDimensional Ideals Using Linear Recurrent Sequences'. Together they form a unique fingerprint.
Projects
 1 Finished

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