Video Lectures

Separate tags with a comma.

In this talk I will construct a “quasisymmetric flag variety”, a subvariety of the complete type A  flag variety built by adapting the BGG geometric construction of divided differences to the newly introduced “quasisymmetric divided differences”...

A Zero-Knowledge PCP Theorem

Nicholas Spooner

Two central results in modern complexity theory can be summed up as follows:

Everything provable is provable in zero knowledge (NP ⊆ CZK); and

Everything provable is locally checkable (NP = PCP[log n, 1]).

In a pair of recent works, we show how to...

Originally introduced as analogs of symmetric spaces for  groups over non-archimedian fields buildings have proven useful in various areas by now. In this talk I will introduce (Bruhat-Tits) buildings,  combinatorial toolkits to study them and their...