Previous Conferences & Workshops

The Ramsey number of a graph $G$ is the minimum integer $n$ for which every edge-coloring of the complete graph on $n$ vertices with two colors contains a monochromatic copy of $G$. A graph is $d$-degenerate if all its subgraphs have a vertex of...

The Colmez conjecture expresses the Faltings height of a CM abelian variety in terms of the logarithmic derivatives of certain Artin L-functions. In this talk, I will present an averaged version of the conjecture proved in my joint work with Shou-Wu...