Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
From MaRDI portal
Publication:2819739
DOI10.1145/2755996.2756673zbMath1346.68269OpenAlexW2001208824MaRDI QIDQ2819739
Jean-Charles Faugère, Brice Boyer, Jérémy Berthomieu
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01237861/file/BMS-HAL.pdf
Gröbner basis computation0-dimensional idealmultidimensional linear recursive sequenceBMS and FGLM algorithms
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Polynomial-division-based algorithms for computing linear recurrence relations, Polynomial-exponential decomposition from moments, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Computing syzygies in finite dimension using fast linear algebra, Sparse FGLM algorithms, Guessing Gröbner bases of structured ideals of relations of sequences
