Guessing linear recurrence relations of sequence tuplesand P-recursive sequences with linear algebra

DOI10.1145/2930889.2930926MaRDI QIDQ2985813zbMATH OpenOpenAlexFDO

Authors Jérémy Berthomieu, Jean-Charles Faugère

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

zbMATH Keywords

FGLM algorithmP-recursive sequencesGröbner bases

Mathematics Subject Classification ID

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

Recommendations

• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Guessing Gröbner bases of structured ideals of relations of sequences
• Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays
• scientific article; zbMATH DE number 2070404
• Polynomial-division-based algorithms for computing linear recurrence relations

Cited in

(7)

• Finding linearly generated subsequences
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
• Automatic conjecturing of P-recursions using lifted inference
• Guessing Gröbner bases of structured ideals of relations of sequences
• Computing syzygies in finite dimension using fast linear algebra
• scientific article; zbMATH DE number 2070404 (Why is no real title available?)

This page was built for publication: Guessing linear recurrence relations of sequence tuplesand P-recursive sequences with linear algebra

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