Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
From MaRDI portal
Publication:2628309
DOI10.1016/j.jsc.2016.11.005zbMath1453.68222OpenAlexW2555323499MaRDI QIDQ2628309
Jean-Charles Faugère, Brice Boyer, Jérémy Berthomieu
Publication date: 1 June 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01253934/file/main.pdf
FGLM algorithmGröbner basis computationBMS algorithm0-dimensional idealmultidimensional linear recursive sequence
Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15)
Related Items
Polynomial-division-based algorithms for computing linear recurrence relations, Symmetry in multivariate ideal interpolation, 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, Guessing Gröbner bases of structured ideals of relations of sequences, Sparse interpolation in terms of multivariate Chebyshev polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Symmetric tensor decomposition
- Introduction to the solution of polynomial systems
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Generalized arithmetical progressions and sumsets
- Linear recurrences with constant coefficients: The multivariate case
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- On the complexity of computing with zero-dimensional triangular sets
- Spectral properties of block multilevel Hankel matrices
- A fraction free matrix Berlekamp/Massey algorithm
- Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property
- Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
- On the matrix berlekamp-massey algorithm
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- The BMS Algorithm
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- Creative Telescoping for Holonomic Functions
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- Shift-register synthesis and BCH decoding
- An Arithmetic Theory of Adjoint Plane Curves
