Joint IAS/PU Groups and Dynamics Seminar

Extremal eigenvalues of graphs are of particular interest in theoretical computer science and combinatorics. Specifically, the spectral gap—the difference between the largest and second-largest eigenvalues—measures the expansion properties of a...

A common heuristic in Diophantine approximation asserts that different arithmetic expansions (such as digit and continued-fraction expansions) should be independent of one another. In some cases, these elementary heuristics have led to surprisingly...