An analysis of inhomogeneous signature-based Gröbner basis computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2013

An analysis of inhomogeneous signature-based Gröbner basis computations

Abstract

In this paper we give an insight into the behaviour of signature-based Gröbner basis algorithms, like F5, G2V or SB, for inhomogeneous input. On the one hand, it seems that the restriction to sig-safe reductions puts a penalty on the performance. The lost connection between polynomial degree and signature degree can disallow lots of reductions and can lead to an overhead in the computations. On the other hand, the way critical pairs are sorted and corresponding s-polynomials are handled in signature- based algorithms is a very efficient one, strongly connected to sorting w.r.t. the well-known sugar degree of polynomials.

Dates and versions

hal-00930286 , version 1 (14-01-2014)

Identifiers

Cite

Christian Eder. An analysis of inhomogeneous signature-based Gröbner basis computations. Journal of Symbolic Computation, 2013, 59, pp.21--35. ⟨10.1016/j.jsc.2013.08.001⟩. ⟨hal-00930286⟩
81 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More