ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a group. Say that GG is plain if it is isomorphic to a free product of finitely many finite groups and finitely many copies of Z\mathbb Z. 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 GG admits a presentation by a finite convergent length-reducing rewriting system if and only if GG 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 NP\mathsf{NP}, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.