Previous Conferences & Workshops

Apr
10
2012

Computer Science/Discrete Mathematics Seminar II

List-Decoding Multiplicity Codes
10:30am|S-101

We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while simultaneously allowing for sublinear-time error-correction. In this...

Apr
09
2012

Members’ Seminar

Computations of Heegaard Floer Homologies
2:00pm|S-101

Heegaard Floer homology groups were recently introduced by Ozsvath and Szabo to study properties of 3-manifolds and knots in them. The definition of the invariants rests on delicate holomorphic geometry, making the actual computations cumbersome. In...

Apr
09
2012

Special Computer Science/Discrete Mathematics Lecture

Random Local Algorithms
Endre Csoka
11:15am|S-101

Consider the problem when we want to construct some structure on a bounded degree graph, e.g. an almost maximum matching, and we want to decide about each edge depending only on its constant radius neighborhood. We show that the information about...

Apr
05
2012

Joint IAS/Princeton University Number Theory Seminar

Constructible Functions, Inegrability, and Harmonic Analysis on p-Adic Groups
4:30pm|Fine Hall -- 214

This talk will be about some new tools based on model theory that could be useful in the study of harmonic analysis on reductive p-adic groups. In 2008, R. Cluckers and F. Loeser defined the class of the so-called "constructible motivic exponential...