Previous Conferences & Workshops
Blow up in a 3-D "toy" model for the Euler equations
We present a 3-D vector dyadic model given in terms of an
infinite system of nonlinearly coupled ODE. This toy model is
inspired by approximations to the fluid equations studied by
Dinaburg and Sinai. The model has structural similarities with
the...
Cynthia Rudin
The goal of Statistical Learning Theory is to construct and
understand algorithms that are able to generalize from a given
training data set. Statistical learning algorithms are wildly
popular now due to their excellent performance on many types
of...
Paraproducts on Polydiscs
We will describe a result which extends the classical
Coifman-Meyer theorem to the multi-parameter setting of polydiscs.
This is based on work recently completed jointly with Jill Pipher,
Terry Tao and Christoph Thiele.
A Hodge Theoretic Approach to the Decomposition Theorem
Let $f:X\to Y$ be a projective map, and assume for simplicity
$X$ to be smooth. The Decomposition Theorem of Beilinson,
Bernstein, Deligne and Gabber states that the (derived direct image
of the constant sheaf ${\bf Q}_X$ is isomorphic to a direct...
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
