Sökning: "Gröbner basis"
Visar resultat 1 - 5 av 10 avhandlingar innehållade orden Gröbner basis.
Sammanfattning : A method is presented for building solvers for classes of multivariate polynomial equations. The method is based on solving an analogous template problem over a finite field, and then using the elimination order established for this problem for the original class of problems. LÄS MER
Sammanfattning : The underlying question in localization is, where am I? In this thesis a purely image based approach is proposed to solve this problem. In order to create a complete image based system, there are many subproblems that have to be addressed. The localization problem can also be solved in other ways, for example, with a GPS. LÄS MER
Sammanfattning : The main result in this thesis is the generalisation of Bergman's diamond lemma for ring theory to power series rings. This generalisation makes it possible to treat problems in which there arise infinite descending chains. LÄS MER
Sammanfattning : This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. LÄS MER
Sammanfattning : The thesis consists of an introduction and the following four papers: Paper I: Using resultants for SAGBI basis verification in the univariate polynomial ring. Authors: Anna Torstensson, Victor Ufnarovski and Hans Öfverbeck. LÄS MER