Papers
Topics
Authors
Recent
Search
2000 character limit reached

Algebraic C(4) and T(4) groups are bi-automatic

Published 28 Sep 2010 in math.GR | (1009.5531v1)

Abstract: S. Gersten and H. Short have proved that if a group has a presentation which satisfies the algebraic C(4) and T(4) small-cancellation condition then the group is automatic. Their proof contains a gap which we aim to close. To do that we distinguish between algebraic small-cancellation conditions and geometric small cancellation conditions (which are conditions on the van Kampen diagrams). We show that, under certain additional requirements, geometric C(4) and T(4) small-cancellation conditions imply bi-automaticity. The additional requirements include a restriction on the labels of edges in minimal van Kampen diagrams. This, together with the so-called barycentric sub-division method proves the theorem.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.