Previous Conferences & Workshops

We give asymptotically precise estimates for the expected time taken for a random walk to visit all vertices of a graph, viz. the cover time. We do this for several models of random graphs viz. $G_{n,p}$ when $p$ is above the connectivity threshold...

We obtain asymptotic lower bounds for the spectral function of the Laplacian and for the remainder in local Weyl's law on compact manifolds. In the negatively curved case, thermodynamic formalism is applied to improve the estimates. Our results can...

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely Generated residually finite group. The same holds for Cartesian products of other simple groups under...

This talk is about joint work with A. Lubotzky. Let $F_n$ be the free group on $n\ge 2$ elements and $\A(F_n)$ its group of automorphisms. We have contructed new linear representations of $\A(F_n)$ arising through the action of finite index...

We will discuss the following very recent result: Theorem. Let R be any finitely generated associative (not necessarily commutative) ring, with 1. Then for any n > stable range rank of the ring R, the group EL_n(R) has Kazhdan's property (T). The...

A finitely generated group is called a Golod-Shafarevich group if it has a presentation with the following property: There exists a prime number p and a real number 0

A RED/BLUE coloring of a graph is called $C$-relaxed if the RED vertices form an independent set, while the BLUE vertices induce connected components of order at most $C$. We show that there exists a smallest integer $C$ such that every cubic graph...

We develop a new technique for proving cell-probe lower bounds for static data structures. Previous lower bounds used a reduction to communication games, which was known not to be tight by counting arguments. We give the first lower bound for an...