Previous Conferences & Workshops

A translation surface is a closed surface that is obtained by gluing edges of a polygon in parallel. The group GL_2(R) acts on the collection translation surfaces of a fixed genus g. For a fixed translation surface S and t>0, we obtain a probability...

A translation surface is a closed surface that is obtained by gluing edges of a polygon in parallel. The group $GL_2(R)$ acts on the collection translation surfaces of a fixed genus g. For a fixed translation surface S and t>0, we obtain a...

Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time complexity of solving computational problems...

The All-Pairs Min-Cut problem (APMC) asks to compute the minimum cut (or equivalently, the maximum flow) between all pairs of nodes in a graph.1 The naive solution of making n^2 calls to a single-pair min-cut algorithm was surpassed in 1961 by a...

We construct the tame part of a split anticyclotomic Euler system in a setting where local multiplicity one does not hold. Instead of the traditional zeta integral approach, we prove the existence of the necessary test vectors using a new method...

Given two families of loops on a closed smooth manifold, one can concatenate the loops at the intersections points of these families to obtain a new family of loops. This is the Chas–Sullivan product on the homology of the free loop space of a...

In many groups, the optimal diameter for the solutions of the isoperimetric problem is asymptotically equivalent to the lower bound coming from their cardinality; in this situation one says that the Følner function is lossless with respect to the...