A common way for lower bounding the expansion of a graph is by
looking the second smallest eigenvalue of its Laplacian matrix.
Also known as the easy direction of Cheeger's inequality, this
bound becomes too weak when the expansion is o(1). In 2004...
Let \chi be a primitive real character. We first establish a
relationship between the existence of the Landau-Siegel zero of
L(s,\chi) and the distribution of zeros of the Dirichlet L-function
L(s,\psi), with \psi belonging to a set \Psi of...
In this lecture I will explain the moment-weight inequality, and
its role in the proof of the Hilbert-Mumford numerical criterion
for $\mu$-stability. The setting is Hamiltonian group actions on
closed Kaehler manifolds. The major ingredients are...
Previous studies of kinetic transport in the Lorentz gas have
been limited to cases where the scatterers are distributed at
random (e.g. at the points of a spatial Poisson process) or at the
vertices of a Euclidean lattice. In this talk I will...
