Previous Conferences & Workshops
What is Tensor Isomorphism?
1:00pm|Simonyi Classroom (S-114)
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...
Surprising Representations in Cohomology of Configurations in Graphs
Nir Gadish
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...
Visual Aspects of Gaussian Periods
6:00pm|Simons Hall Dilworth Room
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...
2:30pm|Simonyi Hall 101 and Remote Access
Trust and Distrust in ML: Using Algorithmic Properties of the Ground Truth
Shafi Goldwasser
2:00pm|Wolfensohn Hall and Remote Access
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...
Legendrian Non-Squeezing via Microsheaves
Eric Kilgore
1:00pm|Simonyi 101 and Remote Access
In this talk I will explain some quantitative embedding results
for Legendrian submanifolds of pre-quantization spaces. To start, I
will recall some contact non-squeezing results for domains, and
present an elementary proof of Legendrian non...
Some applications of homotopy theory to arithmetic geometry
Sanath Devalapurkar
3:35pm|*Princeton University, Fine Hall 224*
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...
Trust and Distrust in ML: Privacy, Verification and Robustness
Shafi Goldwasser
2:00pm|Wolfensohn Hall and Remote Access
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...
Measures on Combinatorial Objects
Andrew Snowden
Suppose given a class of finite combinatorial structures, such
as graphs or total orders. Nate Harman and I recently introduced a
notion of measure in this context: this is a rule assigning a
number to each structure such that some axioms are...
Aperiodic Square Tilings and Lattices in Products of Trees
6:00pm|Simons Hall Dilworth Room
We will consider finite collections of squares tiles, and ask
when we can tile the whole plane in an interesting way. This
question is related to the algebraic structure of ‘lattices in
products of trees’, which are discrete groups acting...
