Previous Conferences & Workshops
Forcing with Random Variables
The links between propositional proof systems and bounded
arithmetic (a generic name for a collection of first-order theories
of arithmetic) have many facets but informally one can view them as
two sides of the same thing: The former is a non...
Local Models of Shimura Varieties
George Pappas
Embedding Almost Spanning Bounded Degree Trees
We derive a sufficient condition for a sparse graph G on n
vertices to contain a copy of a tree T of maximum degree at most d
on (1-\epsilon)n vertices, in terms of the expansion properties of
G. As a result we show that for fixed d>=2 and 0
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...
