Madlener–Otto conjecture on length-reducing rewriting systems
Statement
Let be a group. A finite convergent length-reducing rewriting system for is a presentation by such a system. Madlener–Otto conjecture. admits a finite convergent length-reducing rewriting system if and only if is plain. Here, plain means that is isomorphic to a free product of finitely many factors, each factor being finite or infinite cyclic. This conjecture is presented as part of the program to characterize algebraically the groups admitting presentations by length-reducing systems; its resolution status is not specified in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.