Since Buchberger intrduced the theory of Gröbner bases in 1965 it has become one of the most important tools in constructive algebra and, nowadays, it is the kernel of many algorithms in the theory of polynomial ideals and algebraic geometry. Motivated by the results in polynomial rings there have been investigeated al lot of possibilities to generalise Buchberger's ideas to other types of rings. The perhaps most general concept, though it does not cover all extensions reported in the literature, is the extension to graded structures due to Robbiano and Mora. But in order to obtain algorithmic solutions for the compution of Gröbner bases it needs additional computability assumptions. The subject of this paper is the presentation of some classes of effective graded structures.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:34542 |
| Date | 18 July 2019 |
| Creators | Apel, Joachim |
| Publisher | Universität Leipzig |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:book, info:eu-repo/semantics/book, doc-type:Text |
| Source | Report / Institut für Informatik, Report / Institut für Informatik |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:15-qucosa2-343029, qucosa:34302 |
Page generated in 0.0019 seconds