Fast Algorithm for Border Bases of Artinian Gorenstein Algebras

DOI10.1145/3087604.3087632zbMath1458.13036arXiv1705.01328OpenAlexW2611136656MaRDI QIDQ5119958

Mourrain, Bernard

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.01328

zbMATH Keywords

Hankel matrixGorenstein algebraArtinian algebraborder basislinear recurrence relationBerlekamp-Massey-Sakata algorithm

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) Commutative Artinian rings and modules, finite-dimensional algebras (13E10)

Related Items (3)

Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Symmetry in multivariate ideal interpolation ⋮ Guessing Gröbner bases of structured ideals of relations of sequences

This page was built for publication: Fast Algorithm for Border Bases of Artinian Gorenstein Algebras