Datenbestand vom 25. Mai 2020
Tel: 089 / 66060798
Mo - Fr, 9 - 12 Uhr
Fax: 089 / 66060799
aktualisiert am 25. Mai 2020
978-3-8439-2530-3, Reihe Mathematik
A randomized variant of the Gröbner Walk
111 Seiten, Dissertation Technische Universität Kaiserslautern (2016), Softcover, A5
The conversion of Gröbner bases with respect to different orderings can be done using the Gröbner Walk, regardless the dimension of the ideal, which has been introduced by Collart, Kalkbrener and Mall in 1997. In general, this is less computational costly than to compute a Gröbner basis with respect to the desired ordering directly using Buchberger's famous algorithm.
Gröbner Walk means computing Gröbner bases of an ideal for different orderings along a path through the Gröbner fan. Considering subalgebras instead of ideals, one can formulate the Sagbi Walk, an algorithm similar to the Gröbner Walk algorithm for converting subalgebra bases.\par We present the idea of randomization in the Gröbner Walk. Moreover, we show that the Gröbner Walk also works for arbitrary Gröbner bases. This gives rise to new and efficient versions of the Gröbner Walk, the Random Walk algorithms which we develop for Gröbner bases and for subalgebra bases.