Guessing Gröbner bases of structured ideals of relations of sequences
From MaRDI portal
Publication:2066951
DOI10.1016/j.jsc.2021.11.001zbMath1486.13039arXiv2009.05248OpenAlexW3216121793MaRDI QIDQ2066951
Jérémy Berthomieu, Mohab Safey El Din
Publication date: 17 January 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.05248
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)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of symmetric ideals
- On 3-dimensional lattice walks confined to the positive octant
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Symmetric tensor decomposition
- Polynomial-division-based algorithms for computing linear recurrence relations
- Introduction to the solution of polynomial systems
- Fast algorithms for the characteristic polynomial
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- On fast multiplication of polynomials over arbitrary algebras
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Sparse FGLM algorithms
- Walks confined in a quadrant are not always D-finite
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- Computing syzygies in finite dimension using fast linear algebra
- Truncation bounds for differentially finite series
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
- Gröbner bases of ideals invariant under a commutative group
- Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra
- On a class of error correcting binary group codes
- Sub-cubic change of ordering for Gröbner basis
- Sparse Gröbner bases
- The BMS Algorithm
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Why you should remove zeros from data before guessing
- Fast Algorithm for Border Bases of Artinian Gorenstein Algebras
- Towards Mixed Gröbner Basis Algorithms
- A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations
- Ideals, Varieties, and Algorithms
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- Shift-register synthesis and BCH decoding
