A survey on signature-based Gr\"obner basis computations

This paper is a survey on the area of signature-based Gr\"obner basis algorithms that was initiated by Faug\`ere's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3 different orderings. For this we give translations between different notations and show that besides notations many approaches are just the same. Moreover, we give a general description of how the idea of signatures is quite natural when performing the reduction process using linear algebra. This survey shall help to outline this field of active research.Comment: 53 pages, 8 figures, 11 table

Une approche par l’analyse algébrique effectivedes systèmes linéaires sur des algèbres de Ore

The purpose of this paper is to present a survey on the effective algebraic analysis approach to linear systems theory with applications to control theory and mathematical physics. In particular, we show how the combination of effective methods of computer algebra - based on Gröbner basis techniques over a class of noncommutative polynomial rings of functional operators called Ore algebras - and constructive aspects of module theory and homological algebra enables the characterization of structural properties of linear functional systems. Algorithms are given and a dedicated implementation, called OreAlgebraicAnalysis, based on the Mathematica package HolonomicFunctions, is demonstrated.Le but de ce papier est de présenter un état de l’art d’une approche par l’analyse algébrique effective de la théorie des systèmes linéaires avec des applications à la théorie du contrôle et à la physique mathématique.En particulier, nous montrons comment la combinaison des méthodes effectives de calcul formel - basées sur lestechniques de bases de Gröbner sur une classe d’algèbres polynomiales noncommutatives d’opérateurs fonctionnels appelée algèbres de Ore - et d’aspects constructifs de théorie des modules et d’algèbre homologique permet lacaractérisation de propriétés structurelles des systèmes linéaires fonctionnels. Des algorithmes sont donnés et uneimplémentation dédiée, appelée OREALGEBRAICANALYSIS, basée sur le package Mathematica HOLONOMIC-FUNCTIONS, est présenté

A survey on signature-based algorithms for computing Gröbner basis computations

International audienceThis paper is a survey on the area of signature-based Gröbner basis algorithms that was initiated by Faugère's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3 different orderings. For this we give translations between different notations and show that besides notations many approaches are just the same. Moreover, we give a general description of how the idea of signatures is quite natural when performing the reduction process using linear algebra. This survey shall help to outline this field of active research