L6

In this talk I'll give a general presentation of my recent work that a purely loxodromic Kleinian group of Hausdorff dimension<1 is a classical Schottky group. This gives a complete classification of all Kleinian groups of dimension<1. The proof uses my earlier result on the classification of Kleinian groups of sufficiently small Hausdorff dimension. This result in conjunction to another work (joint with Anderson) provides a resolution to Bers uniformization conjecture. No prior knowledge on the subject is assumed.

Torsion in homology are invariants that have received increasing attention over the last twenty years, by the work of Lück, Bergeron, Venkatesh and others. While there are various vanishing results, no one has found a finitely presented group where the torsion in the first homology is exponential over a normal chain with trivial intersection. On the other hand, conjecturally, every 3-manifold group should be an example.

A group is right angled if it can be generated by a list of infinite order elements, such that every element commutes with its neighbors. Many lattices in higher rank Lie groups (like SL(n,Z), n>2) are right angled. We prove that for a right angled group, the torsion in the first homology has subexponential growth for any Farber sequence of subgroups, in particular, any chain of normal subgroups with trivial intersection. We also exhibit right angled cocompact lattices in SL(n,R) (n>2), for which the Congruence Subgroup Property is not known. This is joint work with Nik Nikolov and Tsachik Gelander.

Let $a_1, \cdots, a_N$ be the sequence of y-smooth numbers up to x (i.e. composed only of primes up to y). When y is a small power of x, what can one say about the size of the gaps $a_{j+1}-a_j$? In particular, what about

$$\sum_1^N (a_{j+1}-a_j)^2?$$

When considering $E_k$ numbers (products of exactly $k$ primes), it is natural to ask, how they are distributed in short intervals. One can show much stronger results when one restricts to almost all intervals. In this context,  we seek the smallest value of c such that the intervals $[x,x+(\log x)^c]$ contain an $E_k$ number almost always. Harman showed that $c=7+\varepsilon$ is admissible for $E_2$ numbers, and this was the best known result also for $E_k$ numbers with $k>2$.

We show that for $E_3$ numbers one can take $c=1+\varepsilon$, which is optimal up to $\varepsilon$. We also obtain the value $c=3.51$ for $E_2$ numbers. The proof uses pointwise, large values and mean value results for Dirichlet polynomials as well as sieve methods.