# Events and Activities

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

### Computer Science/Discrete Mathematics Seminar I

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...

### Computer Science/Discrete Mathematics Seminar II

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...

### Stability and Testability

### Computer Science/Discrete Mathematics Seminar I

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...