Javascript must be enabled for the correct page display

Weighted Greatest Common Divisors

Modderman, Robert (2019) Weighted Greatest Common Divisors. Bachelor's Thesis, Mathematics.

[img]
Preview
Text
bMATH_2019_ModdermanR.pdf

Download (368kB) | Preview
[img] Text
Toestemming.pdf
Restricted to Registered users only

Download (119kB)

Abstract

In this thesis, the notion of weighted greatest common divisor (wgcd) will be discussed and redefined for integral domains. We will use the concept of squarefree factorizations to prove existence and uniqueness (up to unit multiplication) for unique factorization domains. We will use Yun's squarefree factorization algorithm to write algorithms for computing wgcd's of polynomials over some fields, of which some will be implemented in the computer algebra system PARI/GP. We will also extend the idea of factoring the usual gcd to compute wgcd's of polynomials over any field and compare the corresponding algorithm to those based on Yun's algorithm.

Item Type: Thesis (Bachelor's Thesis)
Supervisor:
Supervisor nameSupervisor E mail
Muller, J.S.Steffen.Muller@rug.nl
Degree programme: Mathematics
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 17 Jul 2019
Last Modified: 18 Jul 2019 06:24
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/20293

Actions (login required)

View Item View Item