English

On groups presented by inverse-closed finite convergent length-reducing rewriting systems

Group Theory 2021-08-31 v4 Formal Languages and Automata Theory

Abstract

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are uniformly bounded. This leads to a new algebraic result: the group is plain (isomorphic to the free product of finitely many finite groups and copies of Z\mathbb Z) if and only if a certain relation on the set of non-trivial finite-order elements of the group is transitive on a bounded set. We use this to prove that deciding if a group presented by an inverse-closed finite convergent length-reducing rewriting system is not plain is in NP\mathsf{NP}. A "yes" answer would disprove a longstanding conjecture of Madlener and Otto from 1987. We also prove that the isomorphism problem for plain groups presented by inverse-closed finite convergent length-reducing rewriting systems is in PSPACE\mathsf{PSPACE}.

Keywords

Cite

@article{arxiv.2106.03445,
  title  = {On groups presented by inverse-closed finite convergent length-reducing rewriting systems},
  author = {Murray Elder and Adam Piggott},
  journal= {arXiv preprint arXiv:2106.03445},
  year   = {2021}
}

Comments

15 pages, 6 figures. Typos corrected

R2 v1 2026-06-24T02:54:08.961Z