Previous Conferences & Workshops
Floer Homology and Loop Space Topology I
Floer homology generated by periodic orbits of Hamiltonian
systems is, in general, not a classical homology theory. However,
on phase spaces of cotangent bundle type for systems equivalent to
the geodesic flow, all known structures in loop space...
Computational Complexity and Information Asymmetry in Financial Products
Collateralized Default Obligations (CDOs) and related financial
derivatives have been at the center of the last financial crisis
and subject of ongoing regulatory overhaul. Despite their
demonstrable benefits in economic theory, derivatives suffer...
Unusual Classical Ground States of Matter
L-Functions and Random Matrix Theory
I'll discuss connections between the distribution of zeros and
values of $L$-functions, such as the Riemann zeta function, and of
characteristic polynomials of matrices from the classical compact
groups. Very little background will be assumed and...
A Theory of Cryptographic Complexity
Manoj M. Prabhakaran
In this talk, I shall describe an ongoing project to develop a
complexity theory for cryptographic (multi-party computations.
Different kinds of cryptographic computations involve different
constraints on how information is accessed. Our goal is to...
Loop-Erased Random Walk on Planar Graphs
Loop-erased random walk (LERW) is a random self-avoiding curve
obtained by erasing the loops of a random walk according to
chronological order. Studying LERW on the two-dimensional integer
lattice, Schramm introduced a model of one-parameter planar...
On Eisenstein Series and the Cohomology of Arithmetic Groups
The automorphic cohomology of a reductive $\mathbb{Q}$-group
$G$, defined in terms of the automorphic spectrum of $G$, captures
essential analytic aspects of the arithmetic subgroups of $G$ and
their cohomology. We discuss the actual construction of...
Analytic Methods to Compute Dirichlet L-Functions and Character Sums
I first present an algorithm to compute the truncated theta
function in poly-log time. The algorithm is elementary and suited
for computer implementation. The algorithm is a consequence of the
periodicity of the complex exponential, and the self...
The Friedlander-Milnor Conjecture
This talk will give a more detailled account of the ``basic"
results in A^1-homotopy theory which are used in our approach:
Hurewicz theorem, Lower central series spectral sequence,
A^1-derived functors of nonadditive functors,
Eilenberg-Moore...
The Friedlander-Milnor Conjecture
This talk will give a more detailled account of the ``basic"
results in A^1-homotopy theory which are used in our approach:
Hurewicz theorem, Lower central series spectral sequence,
A^1-derived functors of nonadditive functors,
Eilenberg-Moore...
