2000 character limit reached
Groups with graphical C(6) and C(7) small cancellation presentations
Published 30 Sep 2012 in math.GR | (1210.0178v2)
Abstract: We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation conditions, we construct lacunary hyperbolic groups and groups that coarsely contain prescribed infinite sequences of finite graphs. We prove that groups given by (possibly infinite) graphical C(7) presentations contain non-abelian free subgroups.
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.