National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Non-commutative Gröbner bases
Požárková, Zuzana ; Šťovíček, Jan (advisor) ; Stanovský, David (referee)
In the presented work we define non-commutative Gröbner bases including the necessary basis of non- commutative algebra theory and notion admissible ordering. We present non-commutative variant of the Buchberger algorithm and study how the algorithm can be improved. Analogous to the Gebauer-Möller criteria lead us to detect almost all unnecessary obstructions in the non-commutative case. The obstructions are graphically ilustrated. The Buchberger algorithm can be improved within redundant polynomials. This work is a summary and its specification of the results of some known authors engaged in this field. Presented definitions are ilustrated on examples. We perform proves of some of the statements which have been proven differently by other authors. Powered by TCPDF (www.tcpdf.org)
Non-commutative Gröbner bases
Požárková, Zuzana ; Šťovíček, Jan (advisor) ; Stanovský, David (referee)
In the presented work we define non-commutative Gröbner bases including the necessary basis of non- commutative algebra theory and notion admissible ordering. We present non-commutative variant of the Buchberger algorithm and study how the algorithm can be improved. Analogous to the Gebauer-Möller criteria lead us to detect almost all unnecessary obstructions in the non-commutative case. The obstructions are graphically ilustrated. The Buchberger algorithm can be improved within redundant polynomials. This work is a summary and its specification of the results of some known authors engaged in this field. Presented definitions are ilustrated on examples. We perform proves of some of the statements which have been proven differently by other authors. Powered by TCPDF (www.tcpdf.org)

Interested in being notified about new results for this query?
Subscribe to the RSS feed.