EPSRC Reference: |
EP/F04223X/1 |
Title: |
Subgroups of direct products and right-angled Artin groups |
Principal Investigator: |
Dison, Mr W |
Other Investigators: |
|
Researcher Co-Investigators: |
|
Project Partners: |
|
Department: |
Mathematics |
Organisation: |
University of Bristol |
Scheme: |
Postdoc Research Fellowship |
Starts: |
01 July 2008 |
Ends: |
31 May 2010 |
Value (£): |
194,707
|
EPSRC Research Topic Classifications: |
|
EPSRC Industrial Sector Classifications: |
No relevance to Underpinning Sectors |
|
|
Related Grants: |
|
Panel History: |
Panel Date | Panel Name | Outcome |
13 Mar 2008
|
Mathematics Postdoctoral Interview Panel
|
Announced
|
14 Feb 2008
|
Maths Postdoctoral Fellowships 2008
|
InvitedForInterview
|
|
Summary on Grant Application Form |
Given any mathematical object the collection of its symmetries forms a type of mathematical object called a group. Once one abstracts this notion groups become interesting objects for study in their own right. The fundamental idea of geometric group theory is that given some group in which one is interested one should realise it as the symmetry group of a space, so that powerful topological and geometric methods can be brought to bear. Conversely one can answer questions in geometry or topology by the use of group theoretic machinery.If one takes a loop of wire with a soap film stretched across it, the film will lie in such a way as to minimise its area. What is perhaps surprising is that no matter what shape the wire is bent into, the area of the film will be at most the square of the length of the loop. One models this situation mathematically by considering a simple, closed loop in a smooth Riemannian manifold and looking for immersed 2-dimensional discs whose boundaries coincide with the loop. The solution to Plateau's problem asserts that (with some restrictions on the manifold) least-area filling discs always exist. One can then define the filling function of such a manifold to be the smallest function which bounds the area of least-area filling discs in terms of the length of their boundaries. The asymptotic behaviour of this function gives insight into the structure of the manifold.A generating set S for a group is a subset such that every element of the group can be expressed as the composition of a sequence of elements in S. A sequence (word) in the generators which composes to give the identity element is called a relation. A presentation for a group is a generating set together with a collection of relations R such that every relation in the group can be deduced from relations in R. Such a presentation specifies the group uniquely.One of the fundamental problems in group theory is: given some presentation, can one effectively decide which words in the generators are relations. This is known as the word problem. Associated to a presentation is the so-called Dehn function, which measures the complexity of the word problem in terms of a nave attack by haphazardly applying relations to the given test word. It is defined as the least upper bound (in terms of the length of the word) on the number of relations which must be applied to demonstrate a word as being equal to the identity. The Dehn function gives a measure of the algorithmic complexity of the group; for example, the word problem is solvable if and only if the Dehn function is recursive. By the Filling Theorem Dehn functions should be seen as the algebraic analogues to the filling functions of manifolds. One major strand of my research is to investigate the Dehn functions of important classes of groups.Two fundamental properties which a group may possess are having a finite generating set or, stronger, having a finite presentation. From a geometric group theory perspective these conditions are often necessary hypotheses in theorems as they tame the local structure of spaces associated to the group. There is a canonical space (unique up to a certain notion of equivalence) associated to each group G called a K(G,1)-complex. The condition that G be finitely generated (respectively finitely presented) is equivalent to there existing a K(G,1)-complex whose 1-dimensional (respectively 2-dimensional) skeleton is finite (in a certain sense). One can generalise the two fundamental finiteness properties by asking for a group to possess a K(G,1)-complex whose n-dimensional skeleton is finite. There are also various other notions of higher finiteness.Given some group one might wish to know about the finiteness properties of its subgroups. Central to this task is knowledge of what are known as the BNS invariants of the group. A second major strand of the research proposal involves the investigation of these invariants.
|
Key Findings |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
Potential use in non-academic contexts |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
Impacts |
Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
Summary |
|
Date Materialised |
|
|
Sectors submitted by the Researcher |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
Project URL: |
|
Further Information: |
|
Organisation Website: |
http://www.bris.ac.uk |