2000 character limit reached
Generalized Small Cancellation Presentations for Automatic Groups
Published 28 Jun 2014 in math.GR | (1406.7414v1)
Abstract: By a result of Gersten and Short finite presentations satisfying the usual non-metric small cancellation conditions present biautomatic groups. We show that in the case in which all pieces have length one, a generalization of the C(3)-T(6) condition yields a larger collection of biautomatic groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.