School of Mathematics

The Graph Removal Lemma

Jacob Fox

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(nh) copies of H can be made H-free by removing o(n2) edges. We give a new proof which avoids Szemeredi's regularity lemma and...

GALOIS REPRESENTATIONS AND AUTOMORPHIC FORMS SEMINAR

We shall recall the spectral terms from the trace formula for G and its stabilaization, as well as corresponding terms from the twisted trace formula for GL(N). We shall then discuss aspects of...

GALOIS REPRESENTATIONS AND AUTOMORPHIC FORMS SEMINAR

Suppose that G is a connected, quasisplit, orthogonal or symplectic group over a field F of characteristic 0. We shall describe a classification of the irreducible representations of G(F) if F is...