National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Determining primeness of an ideal?
Stejskal, Adam ; Šťovíček, Jan (advisor) ; Šaroch, Jan (referee)
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We use the Gröbner bases as a main tool for operations with ideals. We show an analogue of Buchberger's algorithm for computing a Gröbner basis for an ideal in polynomials over a ring, which not need to be a field. We also show a relation between prime ideals in polyno- mials over a ring R and prime ideals in polynomials over a quotient ring of R modulo a prime ideal. We are primarilly discussing the issues of theoretical corectness, but we also present the conditions of actual computability. 1
Determining primeness of an ideal?
Stejskal, Adam ; Šťovíček, Jan (advisor) ; Šaroch, Jan (referee)
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We use the Gröbner bases as a main tool for operations with ideals. We show an analogue of Buchberger's algorithm for computing a Gröbner basis for an ideal in polynomials over a ring, which not need to be a field. We also show a relation between prime ideals in polyno- mials over a ring R and prime ideals in polynomials over a quotient ring of R modulo a prime ideal. We are primarilly discussing the issues of theoretical corectness, but we also present the conditions of actual computability. 1

See also: similar author names
2 Stejskal, Aleš
Interested in being notified about new results for this query?
Subscribe to the RSS feed.