We investigate this problem and design several algorithms for computing such a Gröbner basis of an ideal of relations using linear algebra techniques.

Dec 7, 2015 · Linear Algebra for Computing Gröbner. Bases of Linear Recursive Multidimensional Sequences. 40th International Symposium on Symbolic and ...

Jun 24, 2015 · The Berlekamp--Massey--Sakata (BMS) algorithm can be used for finding a Grbner basis of a 0-dimensional ideal of relations verified by a table.

Abstract : The so-called Berlekamp~-- Massey~-- Sakata algorithm computes a Gröbner basis of a 0-dimensional ideal of relations satisfied by an input table.

We first define and characterize multidimensional linear recursive sequences for 0-dimensional ideals. Under genericity assumptions, we propose a randomized ...

Nov 18, 2016 · Abstract. The so-called Berlekamp – Massey – Sakata algorithm computes a Gröbner basis of a 0-dimensional ideal of relations satisfied by an ...

An FGLM-like algorithm for finding the relations in the table is produced, which lets us use linear algebra techniques and make use of fast structured ...

We first define and characterize multidimensional linear recursive sequences for 0-dimensional ideals. Under genericity assumptions, we propose a randomized ...

Jul 6, 2015 · In other words, a linear recursive sequence is a special case of a holonomic (or P-recursive) sequence whose recurrence relations only have ...

Boyer, and J.-C. Faugère, “Linear Algebra for. Computing Gröbner Bases of Linear Recursive Multidimensional. Sequences”, in Journal of Symbolic Computation 83.