Previous Conferences & Workshops

Dec
04
2014

Joint IAS/Princeton University Number Theory Seminar

Level raising mod 2 and arbitrary 2-Selmer ranks
4:30pm|S-101

We prove a level raising mod $p = 2$ theorem for elliptic curves over $\mathbb Q$, generalizing theorems of Ribet and Diamond-Taylor. As an application, we show that the 2-Selmer rank can be arbitrary in level raising families. We will begin by...

Dec
03
2014

Topology of Algebraic Varieties

Minimal log discrepancy of isolated singularities and Reeb orbits
11:15am|S-101

Let $A$ be an affine variety inside a complex $N$ dimensional vector space which either has an isolated singularity at the origin or is smooth at the origin. The intersection of $A$ with a very small sphere turns out to be a contact manifold called...

Dec
02
2014

Topology of Algebraic Varieties

Degeneration of Fano Kahler-Einstein manifolds
Xiaowei Wang
11:00am|Physics Library, Bloomberg Hall 201

In this talk, we will discuss the local geometry of the closure of orbit space that parametrising smooth Fano manifolds inside certain Chow/Hilbert scheme. In particular, we will discuss the separatedness of the moduli of smoothable $K$-polystable $...

Dec
02
2014

Computer Science/Discrete Mathematics Seminar II

Taming the hydra: the Word Problem, Dehn functions, and extreme integer compression
10:30am|S-101

For a finitely presented group, the Word Problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is the time-complexity of a direct attack on the Word Problem by applying the...

Dec
01
2014

Members’ Seminar

Graphs, vectors and integers
2:00pm|S-101

The study of Cayley graphs of finite groups is related to the investigation of pseudo-random graphs and to problems in Combinatorial Number Theory, Geometry and Information Theory. I will discuss this topic, describing the motivation and focusing on...

Dec
01
2014

Computer Science/Discrete Mathematics Seminar I

Parallel Repetition From Fortification
11:15am|S-101

The Parallel Repetition Theorem upper-bounds the value of a repeated (tensored) two prover game in terms of the value of the base game and the number of repetitions. In this work we give a simple transformation on games -- "fortification" -- and...

Nov
25
2014

Topology of Algebraic Varieties

Boundedness of log general type pairs II
11:00am|Physics Library, Bloomberg Hall 201

We will discuss the boundedness of log general type pairs, with the aim on proving the moduli of KSBA stable varieties is bounded.

Nov
25
2014

Computer Science/Discrete Mathematics Seminar II

Sum-of-squares lower bounds for the planted clique problem
10:30am|S-101

Finding large cliques in random graphs and the closely related "planted" clique variant, where a clique of size \(k\) is planted in a random \(G(n,1/2)\) graph, have been the focus of substantial study in algorithm design. Despite much effort, the...

Nov
24
2014

Members’ Seminar

\(P = W\): a strange identity for \(\mathrm{GL}(2,\mathbb C)\)
Mark deCataldo
2:00pm|S-101

Start with a compact Riemann surface \(X\) and a complex reductive group \(G\), like \(\mathrm{GL}(n,\mathbb C)\). According to Hitchin-Simpson's ``non abelian Hodge theory", the pair \((X,G)\) comes with two new complex manifolds: the character...