Events and Activities

Abstract: 

Cryptographic tools enable the safe use of technology platforms controlled by worst case computationally bounded adversaries. In this talk I will show how cryptographic paradigms and tools can be used to address trust issues in various...

Recent work of Drinfeld, Bhatt, and Lurie provides a “geometrization” of the theory of prismatic cohomology, where, for a p-complete commutative ring R, one produces various algebraic stacks (“prismatizations”) whose coherent cohomology identifies...

Abstract: 

Cryptographic tools enable the safe use of technology platforms controlled by worst case computationally bounded adversaries. In this talk I will show how cryptographic paradigms and tools can be used to address trust issues in various...

TBD

TBA

Gaussian periods are certain sums of roots of unity.  Gauss introduced them in his work on straight edge and compass constructions of regular polygons.  Since then, Gaussian periods have played important roles in number theory and beyond.  It turns...

Configuration spaces of points in graphs are nonsmooth analogs of braid arrangements, appearing in robotics applications and in theory of moduli spaces of tropical curves. While their cohomology is extremely difficult to understand, and depends on...

Two graphs are isomorphic if they are the same up relabelling the vertices. Two matrices are equivalent if they are the same up to elementary row and column operations. Tensor isomorphism generalises these basic notions in graph theory and linear...

Large sieve inequalities are a fundamental tool used to investigate prime numbers and exponential sums. In this lecture I will explain my work that resolves a 1978 conjecture of S. Patterson (conditional on the Generalized Riemann hypothesis)...