重写系统、普通群和测地图
Rewriting systems, plain groups, and geodetic graphs
摘要：
我们证明了一个群是由有限收敛的长度减少重写系统，其中每个规则的左手边的长度为3当且仅当该群是平原。我们的证明是通过一个新的结果，嵌入电路的性质测地图，这可能是独立的兴趣在图论。
英文摘要：
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded circuits in geodetic graphs, which may be of independent interest in graph theory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
