Abstract:A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs has a long history in discrete mathematics, going back to the 18th century work of Euler on Latin squares. Since then rainbow structures were the focus of extensive research and found numerous applications in design theory and graph decompositions. Many problem...
AbstractWe consider the standard L-function attached to a cuspidal automorphic representation of a general linear group. We present a proof of a subconvex bound in the t-aspect. More generally, we address the spectral aspect in the case of uniform parameter growth. These results are the subject of the third paper linked below, building on the first two.SpeakerPaul Nelson works in Analytic Numbe...