# The geometry of the word problem for finitely generated by Noel Brady

The origins of the be aware challenge are in crew idea, decidability and complexity. yet throughout the imaginative and prescient of M. Gromov and the language of filling features, the subject now affects the area of large-scale geometry. This booklet includes bills of many fresh advancements in Geometric crew conception and exhibits the interplay among the observe challenge and geometry remains to be a important subject. It comprises many figures, a number of workouts and open questions.

Best abstract books

Intégration: Chapitres 7 et 8

Intégration, Chapitres 7 et 8Les Éléments de mathématique de Nicolas BOURBAKI ont pour objet une présentation rigoureuse, systématique et sans prérequis des mathématiques depuis leurs fondements. Ce quantity du Livre d’Intégration, sixième Livre du traité, traite de l’intégration sur les groupes localement compacts et de ses purposes.

Additional info for The geometry of the word problem for finitely generated groups

Example text

5. 5: The Morse function on the tree T . The ascending link of each vertex consists of a 0-sphere. This corresponds to the fact that there are two edges adjacent to a given vertex which are above the vertex. The descending link is also a 0-sphere. This corresponds to the fact that there are two edges adjacent to, but below, each vertex. Pick an integer t ∈ R. The level set f −1 (t) is a collection of vertices of T which are all at height t. The kernel Ker(F2 → Z) acts on the level set f −1 (t) 52 Chapter 2.

A geodesic triangle ∆(x, y, z) is said to satisfy a CAT(κ) inequality if for all p on the interior of one edge, the distance from p to the opposite vertex in X is bounded above by the distance between the comparison point and corresponding opposite vertex in the model space Mκ2 . In the case that κ > 0 we require that the perimeter of ∆(x, y, z) be 32 Chapter 2. Dehn Functions of Subgroups of CAT(0) Groups less than twice the diameter of the model sphere Mκ2 . In the case κ 0 there is no restriction on the perimeter of triangles.

In this case, one just checks that the metric graph has no essential loops of length less than 2π. Such graphs are called “large”. To summarize, a 2-dimensional Mκ -complex, K, is locally CAT(κ) if Lk(v, K) is large for all vertices v ∈ K. 2. Second is when the spherical complex is composed of right angled spherical simplices. An n-dimensional right angled spherical simplex is deﬁned to be (isometric to) the span of the n + 1 standard unit basis vectors on the unit sphere in Rn+1 . In this case, there is a wonderful result due to Gromov (Gromov’s Lemma) which reduces the CAT(1) check to a purely combinatorial one.