[The University of Leicester]

Department of Mathematics & Computer Science



Next: Bibliography Up: paper3 Previous: Illustration

Remarks

The result that the Knuth-Bendix algorithm is a special case of the noncommutative Buchberger algorithm is something that requires further investigation. Rewriting techniques and the Knuth-Bendix algorithm have recently been applied to presentations of Kan extensions over sets [6] and it is not immediately obvious what this will imply for noncommutative Gröbner bases. Another interesting line of investigation would be to attempt to adapt rewriting procedures for constructing crossed resolutions of group presentations [6] to the more general Gröbner basis situation.



[University Home] [MCS Home] [University Index A-Z] [University Search] [University Help]

Author: A. Heyworth, tel: +44 (0)116 252 3884
Last updated: 2001-05-08
MCS Web Maintainer
This document has been approved by the Head of Department.
© University of Leicester.