Previous Conferences & Workshops

Let \(N \geq 3\). In this talk, I will sketch a proof that the ring generated by Eisenstein series of weight \(1\) on the principal congruence subgroup \(\Gamma(N)\) contains all modular forms in weights \(2\) and above. This means that the only...

The goal of computationally sound symbolic security is to create formal systems of cryptography which have a sound interpretation with respect to complexity-based notions of security. While there has been much progress in the development of such...

We revisit the question, originally posed by Yao (1982), of whether encryption security may be characterized using computational information. Yao provided an affirmative answer, using a compression-based notion of computational information to give a...

More than twenty years ago, Witten proposed a remarkable conjecture connecting the geometry of moduli space of curve or Gromov-Witten theory of point to KdV integrable hierarchies (solved by Kontsevich). Since then, Witten's conjecture opened up a...

We consider the problem of the list-decodability of error correcting codes. The well-known Johnson bound implies that any code with good distance has good list-decodability, but we do not know many structural conditions on a code which guarantee...

One needs no advanced mathematics to understand Borges' stories, but with some mathematical insight is able to see unexpected and nontrivial connections to rigorous math(s). I shall discuss two of those, one combinatorial, the other analytic, and...