Welcome to MathOverflow

Question

1

The question above.

edited Sep 28 2010 at 14:18

Timothy Chow
14.4k●1●68●137

asked Sep 28 2010 at 3:08

student
61●2●8

	I know that the spell checker in your browser will not be able to see the typo in your title, but presumably you can? – Mariano Suárez-Alvarez Sep 28 2010 at 12:31
	I fixed the typo. – Timothy Chow Sep 28 2010 at 14:19

Bugs Bunny · Answer 1 · 2010-09-28 08:04:41Z UTC

Sort of yes, because there is a better algorithm for rings, known under umbrella name of Grobner Basis. It works the nicest for commutative algebras, but there are various versions for algebras over Euclidian domains, associative algebras, Lie algebras etc. What is the ring you are after?

Bruce Westbury · Answer 2 · 2010-09-28 12:24:55Z UTC

2

Yes, this is implemented as the Vector Enumeration in magma:

http://magma.maths.usyd.edu.au/magma/htmlhelp/text942.htm#9432

This is also included in GAP.

http://www.math.jussieu.fr/~jmichel/gap3/htm/chap065.htm

answered Sep 28 2010 at 12:24

Bruce Westbury
6,635●2●10●25

Is there a Todd-Coxeter algorithm for rings?

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

2 Answers

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.