Previous Conferences & Workshops

Feb
23
2010

Geometry/Dynamical Systems Seminar

Lipschitz Maps From Spaces With Many Rectifiable Curves
4:00pm|S-101

We will survey results (partly joint with Kleiner, and with Kleiner and Naor) on possibly fractal metric spaces which in a suitable sense have many rectifiable curves. We will try to cover: differentiable structure, a bi-Lipschitz nonembedding...

Feb
23
2010

Computer Science/Discrete Mathematics Seminar II

Testing Correlations and Inverse Theorems
10:30am|S-101

The uniformity norms are defined in different contexts in order to distinguish the ``typical'' random functions, from the functions that contain certain structures. A typical random function has small uniformity norms, while a function with a non...

Feb
22
2010

Members’ Seminar

Algebraic Properties of the Quantum Homology
2:00pm|S-101

The theory of quantum homology, which originally arose from physics, is currently generating a great deal of interest, due in part to its striking predictions regarding enumerative algebraic geometry. In this talk we will introduce the quantum...

Feb
22
2010

Computer Science/Discrete Mathematics Seminar I

Average Sensitivity of Polynomial Threshold Functions
Rocco Servedio
11:15am|S-101

How many edges of the n-dimensional Boolean hypercube can be sliced by a degree-d polynomial surface? This question can be equivalently stated as "What is the maximum average sensitivity of any degree-d polynomial threshold function?" In 1994...

Feb
19
2010

Joint IAS/Princeton University Mathematical Physics Seminar

Superconcentration
Sourav Chatterjee
4:00pm|S-101

We introduce the term `superconcentration' to describe the phenomenon when a function of a Gaussian random field exhibits a far stronger concentration than predicted by classical concentration of measure. We show that when superconcentration happens...

Feb
18
2010

Joint IAS/Princeton University Number Theory Seminar

Real Quadratic Analogues of Values of the j-Function at CM Points
4:30pm|S-101

An interesting new class of modular forms has emerged in the last several years that generalize Ramanujan's mock theta functions. The generalization is based on an observation of of Zwegers who showed that mock theta functions occur as holomorphic...

Feb
16
2010

Computer Science/Discrete Mathematics Seminar II

Complexity of Constraint Satisfaction problems: Exact and Approximate
Prasad Raghavendra
10:30am|S-101

Is there a common explanation for 2SAT being solvable polynomial time, and Max2SAT being approximable to a 0.91 factor? More generally, it is natural to wonder what characterizes the complexity of exact constraint satisfaction problems (CSP) like...