Madlener and Otto's plain group conjecture
Statement
Let be a group. Say that is plain if it is isomorphic to a free product of finitely many finite groups and finitely many copies of . A finite convergent length-reducing rewriting system is a finite rewriting system that is convergent and whose rewriting rules strictly reduce word length. Madlener and Otto's conjecture. A group admits a presentation by a finite convergent length-reducing rewriting system if and only if is plain. A positive answer to the decision problem for whether such a presented group is not plain would disprove this longstanding conjecture; the paper places that decision problem in , but does not resolve the conjecture.
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.