Previous Conferences & Workshops

Mar
09
2017

Joint IAS/Princeton University Number Theory Seminar

On small sums of roots of unity
4:30pm

Let $k$ be a fixed positive integer. Myerson (and others) asked how small the modulus of a non-zero sum of $k$ roots of unity can be. If the roots of unity have order dividing $N$, then an elementary argument shows that the modulus decreases at most...

Mar
09
2017

Princeton Neuroscience Institute Seminar

The "P vs. NP" problem: efficient computation, Internet security, and the limits to human knowledge
4:30pm

The "P vs. NP" problem, formulated by computer theorists in the 1970s, quickly became a central outstanding problem of science and mathematics. In this talk I will attempt to describe its mathematical, scientific and philosophical content. I will...

Mar
09
2017

Joint IAS/Princeton University Symplectic Geometry Seminar

Fukaya categories and variation of symplectic form
Chris Woodward
10:45am

I hope to talk more about how to find generators for Fukaya categories using symplectic version of the minimal model program in examples such as symplectic quotients of products of spheres and moduli spaces of parabolic bundles.

Mar
08
2017

Mathematical Conversations

Geometric realizations of algebraic objects
Dmitry Orlov
6:00pm

Considering some special examples as algebras of quivers I will give an informal introduction to a field of geometric realizations of noncommutative and derived varieties.

Mar
08
2017

Special Representation Theory Seminar

On the role of rank in representation theory of the classical groups
Roger Howe
2:35pm

Rank gives a natural filtration on representations of classical groups. The eta correspondence provides a clean description of a natural family of representations of a given rank, subject to certain bounds. There is evidence that this construction...

Mar
08
2017

Special Representation Theory Seminar

"Small" representations of finite classical groups
1:30pm

Suppose you have a finite group G and you want to study certain related structures (e.g., random walks, Cayley graphs, word maps, etc.). In many cases, this might be done using sums over the characters of G. A serious obstacle in applying these...