Computational ideal theory and groebner basis
For every ideal in a polynomial ring over a field, there exists a finite basis as stated by Hilbert's Basis Theorem. However, as classical proofs of the theorem are nonconstructive, several academics have attempted to develop constructive proofs of the theorem. Amongst them, Buchberger develope...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2021
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/148504 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | For every ideal in a polynomial ring over a field, there exists a finite basis as stated by Hilbert's Basis Theorem. However, as classical proofs of the theorem are nonconstructive, several academics have attempted to develop constructive proofs of the theorem. Amongst them, Buchberger developed the theory of Groebner basis and came up with an algorithm to construct a basis from any finite generating set. In the first four sections of this paper, I shall attempt to provide an elementary introduction to the theory of Groebner basis. |
|---|