Previous Conferences & Workshops
Operations with Integer Coefficients (After Voevodsky)
We will classify all unstable motivic operations from bidegree
(2n,n) (with coefficients Z) to bidegree (p,q) with coefficients
Z/l, l>2. All such operations are polynomials on the elements of
the Steenrod Algebra. This work is based upon some...
A metal or ceramic is naturally decomposed into cells called
"grains". The geometry of this cell complex influences the
properties of the material. Some interesting mathematical problems
arise in trying to understand the time evolution of these...
Canonical Frames for Nonholonomic Vector Distributions
Igor Zelenko
The talk is based on the joint work with Boris Doubrov. First we
will describe a new rather effective procedure of symplectification
for the problem of local equivalence of nonholonomic vector
distributions. The starting point of this procedure is...
Arithmetic Over Finite and Local Fields
A Product Theorem in Free Groups (Continued)
We will continue the proof of the following result: if A is a
finite subset of a free group with at least two non-commuting
elements then |AAA| is almost quadratic in |A|. Last week we
reduced the problem to obtaining lower bounds on |ABC| when...
Pseudoholomorphic Quilts and Relative Floer Theory
Christopher Woodward
Joint with K. Wehrheim and, in the A-infinity version, with S.
Mau. We construct a calculus of A-infinity functors for Lagrangian
correspondences between monotone symplectic manifolds, and use it
to define relative Floer invariants for three...
Rationally Connected Varieties - Introduction
It has been known for a long time that varieties of general type
are the most complicated algebraic varieties. It is only recently,
however, that the correct definition of the "simplest" algebraic
varieties was established. These are the rationally...
Efficient Algorithms Using the Multiplicative Weights Update Method
Satyen Kale
Algorithms based on convex optimization, especially linear and
semidefinite programming, are ubiquitous in Computer Science. While
there are polynomial time algorithms known to solve such problems,
quite often the running time of these algorithms is...
Applications of the Relative Trace Formula to Central L-Values
4:30pm|Fine Hall 322, Princeton University
Bass' NK Groups and cdh-Fibrant Hochschild Homology
By definition, NK_0(R) is K_0(R[t]) modulo K_0(R). We give a
formula for this group when R is of finite type over a field of
characteristic zero. The group is bigraded and determined by its
typical pieces, which are the cdh cohomology groups H^p(R...
