Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
From MaRDI portal
Recommendations
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Computing Gröbner Bases within Linear Algebra
- Applications of the theory of Gröbner bases to the study of linear recurring arrays
- Linear algebra to compute Syzygies and Gröbner bases
- Linear algebraic approach to Gröbner-Shirshov basis theory
- Computing Boolean Gröbner bases within linear algebra
- Computation of Gröbner bases
- scientific article; zbMATH DE number 5052246
- scientific article; zbMATH DE number 1263402
- scientific article; zbMATH DE number 1163421
Cites work
- A fraction free matrix Berlekamp/Massey algorithm
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- An Arithmetic Theory of Adjoint Plane Curves
- Creative telescoping for holonomic functions
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Generalized arithmetical progressions and sumsets
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 3012084 (Why is no real title available?)
- scientific article; zbMATH DE number 1893704 (Why is no real title available?)
- Introduction to the solution of polynomial systems
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Linear recurrences with constant coefficients: The multivariate case
- Numerically testing generically reduced projective schemes for the arithmetic Gorenstein property
- On the complexity of computing with zero-dimensional triangular sets
- On the matrix Berlekamp-Massey algorithm
- Shift-register synthesis and BCH decoding
- Solving Toeplitz- and Vandermonde-like linear systems with large displacement rank
- Spectral properties of block multilevel Hankel matrices
- Symmetric tensor decomposition
- The BMS Algorithm
Cited in
(13)- Guessing Gröbner bases of structured ideals of relations of sequences
- Sparse interpolation in terms of multivariate Chebyshev polynomials
- 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
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Symmetry in multivariate ideal interpolation
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- scientific article; zbMATH DE number 4105101 (Why is no real title available?)
- Fast algorithm for border bases of Artinian Gorenstein algebras
- A polynomial-division-based algorithm for computing linear recurrence relations
- Algorithms for linearly recurrent sequences of truncated polynomials
- Quasi-linear guessing of minimal lexicographic Gröbner bases of ideals of c-relations of random bi-indexed sequences
- Polynomial-division-based algorithms for computing linear recurrence relations
This page was built for publication: Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628309)
