School of Mathematics

Workshop on Flows, Foliations and Contact Structures 2015-2016 Monday, December 7, 2015 - 08:00 to Friday, December 11, 2015 - 12:00 This workshop is part of the topical program "Geometric Structures on 3-Manifolds" which will take place during the...

Agenda: https://www.ias.edu/math/ffcs/agenda

Workshop on Flows, Foliations and Contact Structures 2015-2016 Monday, December 7, 2015 - 08:00 to Friday, December 11, 2015 - 12:00 This workshop is part of the topical program "Geometric Structures on...

The Langlands program is an intricate network of conjectures, which are meant to connect different areas of mathematics, such as number theory, harmonic analysis and representation theory. One striking consequence of the Langlands program is the...

One of the major challenges of the research in circuit complexity is proving super-polynomial lower bounds for de-Morgan formulas. Karchmer, Raz, and Wigderson suggested to approach this problem by proving that formula complexity behaves "as...

In the first half of the talk I will give a very compressed introduction into parts of Theoretical Distributed Computing from the point of view of mathematician. I will describe how to construct simplicial models whose combinatorics contains...

In this talk we first introduce a new "singularity-free" approach to the proof of Seidel's long exact sequence, including the fixed-point version. This conveniently generalizes to Dehn twists along Lagrangian submanifolds which are rank one...

Ramanujan graphs are optimal expander graphs, and their existence and construction have been the focus of much research during the last three decades. We prove that every bipartite Ramanujan graph has a $d$-covering which is also Ramanujan. This...

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over $\mathbb...

A theorem of Borel's asserts that for any positive real number $V$, there are at most finitely many arithmetic lattices in ${\rm PSL}_2({\mathbb C})$ of covolume at most $V$, or equivalently at most finitely many arithmetic hyperbolid $3$-orbifolds...

Joint work with Oded Goldreich. We prove that random $n$-by-$n$ Toeplitz matrices over $GF(2)$ have rigidity $\Omega(n^3/(r^2 \log n))$ for rank $r > \sqrt{n}$, with high probability. This improves, for $r = o(n / \log n \log\log n)$, over the $...