On a small cancellation theorem of Gromov. (Q2455382): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 08:12, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a small cancellation theorem of Gromov. |
scientific article |
Statements
On a small cancellation theorem of Gromov. (English)
0 references
24 October 2007
0 references
The author gives a proof of a theorem of Gromov that generalizes the basic tool of small cancellation theory to the context of labelled graphs. The theorem states the following: Consider a finite graph whose edges are labelled by generators of the free group \(F_m\) and their inverses in a reduced way specified in the paper. Then, if no word of length greater that \(1/6\) times the length of the smallest loop of the graph appears twice in the graph, the presentation obtained by taking as relations all the words that are read on all loops of the graph defines a hyperbolic group which (if the rank of the graph is at least \(m+1\)) is infinite. Moreover, the given graph naturally embeds into the Cayley graph of the group. -- \textit{M. Gromov}'s result is stated in his paper [Geom. Funct. Anal. 13, No. 1, 73-146 (2003; Zbl 1122.20021)].
0 references
small cancellation theory
0 references
hyperbolic groups
0 references
van Kampen diagrams
0 references