Bill Finkenkeller
<br>
Abstract for talk on 4-7-04
<br>
Title:  	One Less Sugar Cube Please 
		Or
	Optimal Variable Orderings
<br>

	This talk will begin with a review of the different variable orderings we have learned (lexocgraphic, graded, etc.).  Then we will strive to know why Maple uses graded reverse lex and not graded lex.  We will attempt to show instances where one ordering is better than another.  As we have seen with the Buchberger Algorithm, the search for a better algorithm to find a Groebner basis is not entirely in vain, but the instances where one ordering is better than another will not show extreme improvements in the method.  The graded reverse lex ordering will show an improvement, but not too much of an improvement.  I assure the reader that there will be very little discussion of sugar, although I may try to explain why sugar is important (and why it tastes good).