Previous Conferences & Workshops

In a sequence of recent papers, Sudan and coauthors have investigated the relation between testability of properties of Boolean functions and the invariance of the properties with respect to transformations of the domain. Linear-invariance is...

Fontaine and Mazur have a remarkable conjecture that predicts which (p-adic) Galois representations arise from geometry. In the special case of two dimensional representations with distinct Hodge-Tate weights, they further conjecture that these...

Let $\overline K$ be an algebraic closure of a $p$-adic field $K$. We construct a separated noetherian regular scheme $X$ (nonalgebraic) equipped with an action of $G_K=\mathrm{Gal}(\overline{K}/K)$. We have $H^0(X, O_X) = Q_p$ and $H_1(X, O_X) = 0$...

The cohomology of arithmetic groups (with real coefficients) is usually understood in terms of automorphic forms. Such methods, however, fail (at least naively) to capture information about torsion classes in integral cohomology. We discuss a...

Finding the longest increasing subsequence (LIS) is a classic algorithmic problem. Simple O(n log n) algorithms, based on dynamic programming, are known for solving this problem exactly on arrays of length n. In this talk I'll discuss recent work of...

Given a Hamiltonian on $T^n\times R^n$, we shall explain how the sequence of suitably rescaled (i.e. homogenized) Hamiltonians, converges, for a suitably defined symplectic metric. We shall then explain some applications, in particular to symplectic...

I will talk about the computational complexity of computing the noncommutative determinant. In contrast to the case of commutative algebras, we know of (virtually) no efficient algorithms to compute the determinant over non-commutative domains. Our...