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:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/148504 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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. |
|---|