EPSRC logo

Details of Grant 

EPSRC Reference: EP/M016641/1
Title: Independence in groups, graphs and the integers
Principal Investigator: Treglown, Dr A C
Other Investigators:
Researcher Co-Investigators:
Project Partners:
Department: School of Mathematics
Organisation: University of Birmingham
Scheme: EPSRC Fellowship
Starts: 01 June 2015 Ends: 31 May 2018 Value (£): 265,986
EPSRC Research Topic Classifications:
Algebra & Geometry Logic & Combinatorics
EPSRC Industrial Sector Classifications:
No relevance to Underpinning Sectors
Related Grants:
Panel History:
Panel DatePanel NameOutcome
21 Jan 2015 EPSRC Mathematics Fellowship Interviews January 2015 Announced
26 Nov 2014 EPSRC Mathematics Prioritisation Panel November 2014 Announced
Summary on Grant Application Form
A fundamental aim in mathematics is to develop techniques that apply to a range of problems across different topics. One of the most exciting recent developments in this direction has been the emergence of 'independence' as a unifying concept. Indeed, many fundamental results and open problems in algebra, combinatorics and number theory can be rephrased in terms of independent sets in hypergraphs. For example, the famous Szemerédi theorem on arithmetic progressions in the integers can be phrased in the language of independent sets.

Novel approaches developed in the last few years have led to the resolution of many seemingly unrelated classical open problems in this area. This has led to a drive for techniques that are universal to the theory. The underlying goal of the proposal is to develop such techniques. These methods will be applied to tackle a range of challenging problems at the interface of algebra, combinatorics, number theory and probability theory.

The research in the project consists of three interconnected themes. Firstly, the project will investigate solution-free sets of integers; this unifying notion encapsulates a range of major topics in number theory such as arithmetic progressions, Sidon sets and sum-free sets. Secondly, the project will explore the interplay between counting sum-free sets in abelian groups and the size of the largest such set. Another major aspect of the project is to investigate how 'robust' a combinatorial property is. This part of the project will be studied from a probabilistic point of view. In particular, we will seek a deeper understanding of sharp threshold phenomena in the evolution of random graphs, an area which has close ties to measure theory and statistical physics.

In the past, many problems in algebra and number theory related to this proposal have been tackled via Fourier analytical methods. One long-term aim of this proposal is to provide additional combinatorial approaches that are beneficial for these research communities. For example, one key component of this project is to develop so-called container results which provide information on the distribution of independent sets; such tools have proven vital in the study of a number of 'counting' problems. Another crucial element of the proposal is to develop a better understanding of the structure of independent sets in given algebraic objects.
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
Description This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
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.bham.ac.uk