Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra
From MaRDI portal
Publication:2985813
DOI10.1145/2930889.2930926zbMath1362.13026OpenAlexW2501356257MaRDI QIDQ2985813
Jean-Charles Faugère, Jérémy Berthomieu
Publication date: 10 May 2017
Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01314266/file/main_HAL.pdf
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
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, Automatic conjecturing of P-recursions using lifted inference, Guessing Gröbner bases of structured ideals of relations of sequences
