Algorithms for zero-dimensional ideals using linear recurrent sequences

DOI10.1007/978-3-319-66320-3_23MaRDI QIDQ1701497zbMATH OpenOpenAlexFDO

Authors Vincent Neiger, Hamid Rahkooy, Éric Schost

Publication date 23 February 2018

Full work available at URL https://arxiv.org/abs/1707.01971

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

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.

Recommendations

• Computing the primary decomposition of zero-dimensional ideals
• Block-Krylov techniques in the context of sparse-FGLM algorithms
• scientific article; zbMATH DE number 1383108
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• On radical zero-dimensional ideals

Cited in

(4)

• scientific article; zbMATH DE number 1406443 (Why is no real title available?)
• Guessing Gröbner bases of structured ideals of relations of sequences
• Block-Krylov techniques in the context of sparse-FGLM algorithms
• Algorithms for linearly recurrent sequences of truncated polynomials

This page was built for publication: Algorithms for zero-dimensional ideals using linear recurrent sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701497)