Communication Dans Un Congrès Année : 2025

Quasi-Linear Guessing of Minimal Lexicographic Gröbner Bases of Ideals of C-Relations of Random Bi-Indexed Sequences

Jérémy Berthomieu
Romain Lebreton
Kevin Tran
  • Fonction : Auteur
  • PersonId : 1504480

Résumé

Computing recurrence relations for sequences is a central problem in computer algebra, with applications in error-correcting codes, Gröbner basis computation, and sparse interpolation. While uni-indexed C-recursive sequences benefit from quasi-linear algorithms leveraging the half-gcd method, the extension to multi-indexed sequences remains computationally challenging. Existing methods for bi-indexed sequences achieve quadratic complexity at best, limiting their practical use. This paper presents a quasi-linear algorithm for computing lexicographic Gröbner bases of the ideal of C-relations associated to bi-indexed sequences. Our approach extends the half-gcd algorithm in $K^N$[$y$] by integrating a pseudo-Euclidean division. This approach shows how to leverage the bi-Hankel structure of the matrix, significantly improving the efficiency of computing minimal C-relations closing the complexity gap between the uni- and bi-indexed cases. Our algorithm is restricted to bi-indexed sequences whose associated bi-Hankel matrix has generic row rank profile.

Fichier principal
Vignette du fichier
paper_53-5.pdf (679.06 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04937888 , version 1 (10-02-2025)
hal-04937888 , version 2 (16-06-2025)

Licence

Identifiants

Citer

Jérémy Berthomieu, Romain Lebreton, Kevin Tran. Quasi-Linear Guessing of Minimal Lexicographic Gröbner Bases of Ideals of C-Relations of Random Bi-Indexed Sequences. ISSAC 2025 - International Symposium on Symbolic and Algebraic Computation, Jul 2025, Guanajuato, Mexico. pp.258-266, ⟨10.1145/3747199.3747569⟩. ⟨hal-04937888v2⟩
844 Consultations
523 Téléchargements

Altmetric

Partager

  • More