Gilman's 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, where each rewriting rule has a right-hand side of length at most one. Gilman's conjecture. admits a finite convergent length-reducing rewriting system in which the right-hand side of every rule has length at most one 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. The conjecture has been solved positively by Eisenberg and the second author, giving a characterization of the groups admitting these rewriting-system presentations.
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.