Changing the ordering of Gröbner Bases with LLL: Case of Two Variables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Changing the ordering of Gröbner Bases with LLL: Case of Two Variables

Abstract

We present an algorithm for the transformation of a Gröbner basis of an ideal with respect to any given ordering into a Gröbner basis with respect to any other ordering. This algorithm is based on a modified version of the LLL algorithm. The worst case theoretical complexity of this algorithm is not better than the complexity of the FGLM algorithm; but can also give the theoretical complexity with some parameters depending on the size of the output. When the output is small then algorithm is more efficient. We also present a first implementation of the algorithm in Maple. This algorithm is restricted to the case of two variables but works also in positive dimension.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4746.pdf (255.06 Ko) Télécharger le fichier

Dates and versions

inria-00071841 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071841 , version 1

Cite

Abdolali Basiri, Jean-Charles Faugère. Changing the ordering of Gröbner Bases with LLL: Case of Two Variables. [Research Report] RR-4746, INRIA. 2003. ⟨inria-00071841⟩
95 View
157 Download

Share

Gmail Facebook Twitter LinkedIn More