Previous Conferences & Workshops
Geometric symmetrizations in high dimension
A classical method for proving geometric inequalities in which
the Euclidean ball is the extremal case, is that of symmetrization.
The idea is basically to perform a simple operation on a given
convex body in n-dimensional space, which makes it more...
Approximation algorithms and Grothendieck type inequalities
I will describe a connection between a classical inequality of
Grothendieck and approximation algorithms based on semi-definite
programming. The investigation of this connection suggests the
definition of a new graph parameter, called the...
Extremal graphs, recursive functions and a separation theorem in property testing
Asaf Shapira
A graph property P is said to be uniformly-testable if there is
a property-tester for P that receives the error parameter \epsilon
as part of the input, and whose query complexity is a function of
\epsilon only. P is said to be non-uniformly...
Equivariant localization and quot schemes
Equivariant localization provides a powerful method for
explicitly computing equivariant and ordinary cohomology rings of
spaces with large symmetry groups. One of the most useful
localization formulas, due to Goresky-Kottwitz-MacPherson,
describes...
Jozsef Beck
I want to show proofs for two things: (1) what kind of
complicated structures can a player build in a "generalized
Tic-Tac-Toe game", and (2) how to get the "exact solutions" of
infinitely many games. I'll try to illustrate the ideas on
simple...
Madhu Sudan
We present new PCPs for NP-complete languages. The PCPs are only
n poly log n bits long, when proving satisfiability of formulae of
length n. However, the probabilistic verifier needs to query poly
log n bits of the proof to verify it. In contrast...
