SIEVE METHODS IN GROUP THEORY III: Aut(Fn)

Sieve Methods in Group Theory I: Powers in Linear Groups

The sieve method is a classic one in number theory (see, for example, [FI]). Recently it found some applications in a non-commutative setting. On the one hand, Bourgain-Gamburd-Sarnak [BGS1] applied it in studying almost-prime vectors in orbits of non-commutative groups acting on Z. On the other hand, Rivin [Ri] and Kowalski [Ko] used it to study generic properties of elements in the mapping cl...

Sieve methods

Sieve Methods

Preface Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after the pioneering work of Viggo Brun (see [Bru16],[Bru19], [Bru22]). Using his formulation of ...

Sieve methods in combinatorics

We develop the Turán sieve and a ‘simple sieve’ in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turán sieve. © 2004 Elsevier Inc....

Probabilistic Methods in Group Theory

The application of probabilistic methods to another chapter of mathematics (number theory, different branches of analysis, graph theory etc .) has in the last 30 years often led to interesting results, which could not be obtained by the usual methods of the chapters in question . These results are in most cases of the following character : it is shown that in some sense "most" elements of a set...