Use this URL to cite or link to this record in EThOS:
Title: Asymptotic invariants of infinite discrete groups
Author: Riley, Timothy Rupert
ISNI:       0000 0001 3519 4237
Awarding Body: University of Oxford
Current Institution: University of Oxford
Date of Award: 2002
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
Asymptotic cones. A finitely generated group has a word metric, which one can scale and thereby view the group from increasingly distant vantage points. The group coalesces to an "asymptotic cone" in the limit (this is made precise using techniques of non-standard analysis). The reward is that in place of the discrete group one has a continuous object "that is amenable to attack by geometric (e.g. topological, infinitesimal) machinery" (to quote Gromov). We give coarse geometric conditions for a metric space X to have N-connected asymptotic cones. These conditions are expressed in terms of certain filling functions concerning filling N-spheres in an appropriately coarse sense. We interpret the criteria in the case where X is a finitely generated group Γ with a word metric. This leads to upper bounds on filling functions for groups with simply connected cones -- in particular they have linearly bounded filling length functions. We prove that if all the asymptotic cones of Γ are N-connected then Γ is of type FN+1 and we provide N-th order isoperimetric and isodiametric functions. Also we show that the asymptotic cones of a virtually polycyclic group Γ are all contractible if and only if Γ is virtually nilpotent. Combable groups and almost-convex groups. A combing of a finitely generated group Γ is a normal form; that is a choice of word (a combing line) for each group element that satisfies a geometric constraint: nearby group elements have combing lines that fellow travel. An almost-convexity condition concerns the geometry of closed balls in the Cayley graph for Γ. We show that even the most mild combability or almost-convexity restrictions on a finitely presented group already force surprisingly strong constraints on the geometry of its word problem. In both cases we obtain an n! isoperimetric function, and upper bounds of ~ n2 on both the minimal isodiametric function and the filling length function.
Supervisor: Bridson, Martin Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Group theory and generalizations (mathematics) ; group ; asymptotic cone ; isoperimetric inequality ; combing