Attempts at Computing Gröbner Bases without S-polynomials whenever Possible

Loading...
Thumbnail Image
Date
2017
Authors
Akritas, Alkiviadis G.
Malaschonok, Gennadi
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this note we lay down some thoughts on computing Grobner bases using subresultant polynomial remainder sequences (prs’s) to eliminate variables. In this way we try to minimise 5-polynomial computations and, if possible, to completely avoid them. A personal note to us by Bruno Buchberger - at the Polynomial Computer Algebra conference (PCA-2015) in St. Petersburg, Russia - served as the motivation for our effort.
Description
Keywords
Grobner bases, computations, Buchberger’s Original Algorithm, conference materials
Citation
Akritas A. Attempts at Computing Gröbner Bases without S-polynomials whenever Possible / Alkiviadis G. Akritas, Gennadi Malaschonok // Mathematical Partnership, Parallel Computing and Computer Algebra : International Conference (Israel, Jerusalem, July, 10-16). - Tambov: Publishing House of TSU, 2017. - P. 40-41.