Modderman, Robert (2019) Weighted Greatest Common Divisors. Bachelor's Thesis, Mathematics.
|
Text
bMATH_2019_ModdermanR.pdf Download (368kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
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 name: | Muller, J.S. |
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 17 Jul 2019 |
| Last Modified: | 18 Jul 2019 06:24 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/20293 |
Actions (login required)
 |
View Item |