Talk:Monomial order
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
surprising claim[edit]
I've been surprised by this claim
"For example, grevlex has a reputation for producing relatively small Gröbner bases".
This is false for generic ideals. What is true for grevlex is that it's the order that is the quickest to compute, (D. Bayer and M. Stillman,"A theorem on refining division orders by the reverse lexicographic order", Duke Math. J. 55 (1987), no. 2, p. 321-328). VanceIII (talk) 08:46, 5 June 2009 (UTC)