Talk:Buchberger's algorithm

Mathematics Start‑class Mid‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-priority on the project's priority scale.

The remark that Buchberger's algorithm is (not considering any refinements thereof) the only known way to compute Groebner bases is not correct.

Another approach that has been implemented (and that has been found to be very competitive in terms of running time) is based on the concept of involutive bases. The latter are based on ideas from differential algebra, in particular on work from the french mathematician Riquier. Involutive bases have been investigated, among others, by Gerdt and Blinkov.

62.214.243.240 20:11, 17 June 2006 (UTC)[reply]

This article should include a discussion with examples about the complete reduction of S(i,j) by G and I wish to add this.Youriens (talk) 18:28, 8 April 2021 (UTC)[reply]

As the article is presently written, this is the complete reduction that is used. The lacking content is that one gets an correct algorithm by using lead reduction instead of complete reduction, and doing complete reduction only after the termination of the main loop. Be free to clarify the equivalence of these two variants. D.Lazard (talk) 19:51, 8 April 2021 (UTC)[reply]