Back to search

Università degli studi di Trento

New Strategies for Computing Gröbner Bases

Abstract

dc:description

Gröbner bases are special sets of polynomials, which are useful to solve problems in many fields such as computer vision, geometric modeling, geometric theorem proving, optimization, control theory, statistics, communications, biology, robotics, coding theory, and cryptography. The major disadvantage of algorithms to compute Gröbner bases is that computations can use a lot of computer power. One of the reasons is the amount of useless critical pairs that the algorithm has to compute. Hence, a lot of effort has been put into developing new criteria to detect such pairs in advance. This thesis is devoted to describe efficient algorithms for the computation of Gröbner bases, with particular emphasis to those based on polynomial signatures. The idea of associating each polynomial with a signature on which the criteria and reduction steps depend, has become extremely popular in part due to its good performance. Our main result combines the criteria from Gao-Volny-Wang's algorithm with the knowledge of Hilbert Series. A parallel implementation of the algorithm is also investigated to improve the computational efficiency. Our algorithm is implemented in CoCoALib, a C++ free library for computations in commutative algebra.

Degree

thesis:*
Grantor dc:publisher
Università degli studi di Trento
Year dc:date
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gameiro Simoes, Bruno Manuel

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
  • license:Tutti i diritti riservati (All rights reserved)
Language dc:language
eng

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Università degli Studi di Trento
Base URL
iris.unitn.it/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Gameiro Simoes, Bruno Manuel. New Strategies for Computing Gröbner Bases. Università degli studi di Trento, 2013. https://hdl.handle.net/11572/369198