Gröbner Basis with applications
A basis for an ideal is such that every element in the ideal can be expressed as a linear combination of the basis. With a Gröbner Basis, every polynomial can be expressed as a linear combination of the basis with a unique remainder. In recent years, there has been a growing study in such classical...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/139095 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-139095 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1390952023-02-28T23:17:11Z Gröbner Basis with applications Zhang, Eric Boyuan Wu Guohua School of Physical and Mathematical Sciences guohua@ntu.edu.sg Science::Mathematics::Algebra A basis for an ideal is such that every element in the ideal can be expressed as a linear combination of the basis. With a Gröbner Basis, every polynomial can be expressed as a linear combination of the basis with a unique remainder. In recent years, there has been a growing study in such classical cases with its applications to areas outside of mathematics. We study the concept of a Gröbner Basis and analyse fundamental theorems such as Dickson’s lemma and Hilbert Basis Theorem that are necessary for the construction of the Gröbner bases and improved algorithms to produce such a basis. We provide an alternative perspective for some fundamental theorems as well as the F4 algorithm which reduces the computational complexity of Buchberger’s algorithm. Further, we explore applications of Gröbner bases to Algebraic Geometry and Commutative Algebra. Bachelor of Science in Mathematical Sciences 2020-05-15T06:29:05Z 2020-05-15T06:29:05Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/139095 en application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Mathematics::Algebra |
spellingShingle |
Science::Mathematics::Algebra Zhang, Eric Boyuan Gröbner Basis with applications |
description |
A basis for an ideal is such that every element in the ideal can be expressed as a linear combination of the basis. With a Gröbner Basis, every polynomial can be expressed as a linear combination of the basis with a unique remainder. In recent years, there has been a growing study in such classical cases with its applications to areas outside of mathematics. We study the concept of a Gröbner Basis and analyse fundamental theorems such as Dickson’s lemma and Hilbert Basis Theorem that are necessary for the construction of the Gröbner bases and improved algorithms to produce such a basis. We provide an alternative perspective for some fundamental theorems as well as the F4 algorithm which reduces the computational complexity of Buchberger’s algorithm. Further, we explore applications of Gröbner bases to Algebraic Geometry and Commutative Algebra. |
author2 |
Wu Guohua |
author_facet |
Wu Guohua Zhang, Eric Boyuan |
format |
Final Year Project |
author |
Zhang, Eric Boyuan |
author_sort |
Zhang, Eric Boyuan |
title |
Gröbner Basis with applications |
title_short |
Gröbner Basis with applications |
title_full |
Gröbner Basis with applications |
title_fullStr |
Gröbner Basis with applications |
title_full_unstemmed |
Gröbner Basis with applications |
title_sort |
gröbner basis with applications |
publisher |
Nanyang Technological University |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/139095 |
_version_ |
1759857000631500800 |