Previous Conferences & Workshops

Nov
11
2013

Members’ Seminar

cdh methods in K-theory and Hochschild homology
2:00pm|S-101

This is intended to be a survey talk, accessible to a general mathematical audience. The cdh topology was created by Voevodsky to extend motivic cohomology from smooth varieties to singular varieties, assuming resolution of singularities (for...

Nov
11
2013

Computer Science/Discrete Mathematics Seminar I

Communication Lower Bounds via Block Sensitivity
Toni Pitassi
11:15am|S-101

We use critical block sensitivity, a new complexity measure introduced by Huynh and Nordstrom (STOC 2012) to study the communication complexity of search problems. Our main result is a simple proof that if \(S\) is a search problem with high...

Nov
08
2013

Mathematical Conversations

The cosmic Galois group, a tale of geometry, number theory and physics
6:30pm|Dilworth Room

Grothendieck has proposed, under the name of "motives" a kind of Galois theory for non algebraic numbers. A mystery of the so-called "standard model" in high energy physics is the occurrence of about twenty numerical constants, independent of the...

Nov
08
2013

Joint IAS/Princeton University Symplectic Geometry Seminar

Tori in four-dimensional Milnor fibres
1:30pm|Fine 322, Princeton University

The Milnor fibre of any isolated hypersurface singularity contains exact Lagrangian spheres: the vanishing cycles associated to a Morsification of the singularity. Moreover, for simple singularities, it is known that the only possible exact...

Nov
07
2013

Joint IAS/Princeton University Number Theory Seminar

Heegner points and a B-SD conjecture
4:30pm|Fine 214, Princeton University

We prove a B-SD conjecture for elliptic curves (for the \(p^\infty\) Selmer groups with arbitrary rank) a la Mazur-Tate and Darmon in anti-cyclotomic setting, for certain primes \(p\). This is done, among other things, by proving a conjecture of...

Nov
07
2013

Princeton University Mathematics Department Special Colloquium

On sparse block models
Elchanan Mossel
3:00pm|Fine 314, Princeton University

Block models are random graph models which have been extensively studied in statistics and theoretical computer science as models of communities and clustering. A conjecture from statistical physics by Decelle et. al predicts an exact formula for...