A Gröbner-Basis Theory for Divide-and-Conquer Recurrences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

A Gröbner-Basis Theory for Divide-and-Conquer Recurrences


We introduce a variety of noncommutative polynomials that represent divide-and-conquer recurrence systems. Our setting involves at the same time variables that behave like words in purely noncom-mutative algebras and variables governed by commutation rules like in skew polynomial rings. We then develop a Gröbner-basis theory for left ideals of such polynomials. Strikingly, the nature of commutations generally prevents the leading monomial of a polynomial product to be the product of the leading monomials. To overcome the difficulty, we consider a specific monomial ordering, together with a restriction to monic divisors in intermediate steps. After obtaining an analogue of Buchberger's algorithm, we develop a variant of the 4 algorithm, whose speed we compare.
Fichier principal
Vignette du fichier
gbdacr.pdf (598.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02885579 , version 1 (30-06-2020)



Frédéric Chyzak, Philippe Dumas. A Gröbner-Basis Theory for Divide-and-Conquer Recurrences. ISSAC - 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. ⟨10.1145/3373207.3404055⟩. ⟨hal-02885579⟩
57 View
144 Download



Gmail Facebook Twitter LinkedIn More