Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

Mar
01
2021

Computer Science/Discrete Mathematics Seminar I

Rainbow structures, Latin squares & graph decompositions
Benny Sudakov
11:15am|Remote Access - see Zoom link below

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours.  The study of rainbow subgraphs goes back to the work of Euler on Latin squares in the 18th century.  Since then rainbow structures were the focus of...

Mar
02
2021

Computer Science/Discrete Mathematics Seminar II

Solving Laplacian Systems of Directed Graphs
10:30am|Remote Access - see Zoom link below

This talk introduces a directed analog of the classical Laplacian matrix and discusses algorithms for solving certain problems related to them. Of particular interest is that using such algorithms, one can compute the stationary distribution of a...

Mar
03
2021

Stability and Testability

Topological obstructions to matrix stability of discrete groups
Marius Dadarlat
11:00am|Remote Access
A discrete countable group is matricially stable if its finite dimensional approximate unitary representations are perturbable to genuine representations in the point-norm topology. We aim to explain in accessible terms why matricial stability for a...
Mar
08
2021

Computer Science/Discrete Mathematics Seminar I

Strong refutation of semi-random Boolean CSPs
11:15am|Remote Access - see Zoom link below

For a fixed integer k > 1, the Boolean k-XOR problem consists of a system of linear equations mod 2 with each equation involving exactly k variables. We give an algorithm to strongly refute *semi-random* instances of the Boolean k-XOR problem on n...

Mar
10
2021

Stability and Testability

Constraint metric approximation and constraint stability
Liviu Paunescu
11:00am|Remote Access
Constraint metric approximation is about constructing an approximation of a group $G$, when the approximation is already given for a subgroup $H$. Similarly, constraint stability is about lifting a representation of a group $G$, when the lift is...
Mar
17
2021

Stability and Testability

Approximate representations of symplectomorphisms via quantization
Leonid Polterovich
11:00am|Remote Access
We argue that quantization, a mathematical model of the quantum classical correspondence, gives rise to approximate unitary representations of symplectomorphism groups. As an application, we get an obstruction to symplectic action of Lubotzky...