Previous Conferences & Workshops
Towards Harmful Low-Rate Noise Models for Quantum Computers
We propose and discuss two conjectures on the nature of errors
in highly correlated noisy physical stochastic systems. The first
asserts that errors for a pair of substantially correlated elements
are themselves substantially correlated. The second...
Steenrod and Milnor Operations
A Weyl-like bound for automorphic L-Functions
A central problem in the theory of L-functions is to investigate
their sizes on the critical line. The convexity bound, which
follows from the Phragmen-Lindelof principle, is of little use in
applications. Therefore much effort has been made to...
Micea Mustata and Nero Budur
We start by stating the general form of the Minimal Model
Conjecture and explain the relevance of some recent work of
Bouksom-Demailly-Paun-Peternell. After that we describe the general
picture of the proof of Hacon et al for the general type case.
Moduli of Metaplectic Bundles on Curves and Theta-Sheaves
We give a geometric analog of the Weil representation of the
metaplectic group, placing it in the framework of the geometric
Langlands program. For a smooth projective curve X we introduce an
algebraic stack \tilde\Bun_G of metaplectic bundles on X...
Critical 2d Models on the Annulus
John Cardy
I conjecture a form for the scaling limit of the partition
function of the critical O(n) and Potts models on the annulus,
using Coulomb gas methods. This has several subtleties whose
elucidation sheds light on the nature of the Coulomb gas
mapping.
Locally Residual Currents and Dolbeault Cohomology on Projective Manifolds
First we define, for any analytic manifold $X$ of dimension $n$,
locally residual currents; $C^{q,p}$ denotes the sheaf of locally
residual currents of bidegree $(q,p)$. Then, we have a fundamental
resolution of the sheaf of holomorphic $q-$forms $...
Fundamental Remarks on the Lemma
Guenter Harder
2-Source Dispersers for Sub-Polynomial Min-Entropy and Ramsey Graphs Beating the Frankl Wilson Construction
The main result of this work is an explicit disperser for two
independent sources on $n$ bits, each of entropy $k=n^{o(1)}$. Put
differently, setting $N=2^n$ and $K=2^k$, we construct explicit $N
\times N$ Boolean matrices for which no $K \times K$...
2-Source Dispersers for n^{o(1)} Entropy, and Ramsey Graphs Beating theFrankl-Wilson Construction
The main result of this work is an explicit disperser for two
independent sources on n bits, each of entropy k=n^{o(1)}. Put
differently, setting N=2^n and K=2^k, we construct explicit N by N
Boolean matrices for which no K by K submatrix is...