Changing the ordering of Grobner Bases with LLL: Case of Two Variables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Changing the ordering of Grobner 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.
No file

Dates and versions

inria-00099732 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099732 , version 1

Cite

Ali Basiri, Jean-Charles Faugère. Changing the ordering of Grobner Bases with LLL: Case of Two Variables. International Symposium on Symbolic and Algebraic Computation - ISSAC 03, 2003, Philadelphie, USA, pp.23-29. ⟨inria-00099732⟩
127 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More