## Non-commutative rank

A linear matrix is a matrix whose entries are linear forms in some indeterminates $t_1,\dots, t_m$ with coefficients in some field $F$. The *commutative rank* of a linear matrix is obtained by interpreting it as a matrix with entries in the function field $F(t_1,\dots,t_m)$, and is directly related to the central PIT (polynomial identity testing) problem. The

## Spacetime positive mass theorem

## On the topology and index of minimal surfaces

## Near-Optimal Strong Dispersers

Randomness dispersers are an important tool in the theory of pseudorandomness, with numerous applications. In this talk, we will consider one-bit strong dispersers and show their connection to erasure list-decodable codes and Ramsey graphs.

## The Sample Complexity of Multi-Reference Alignment

## Drinfeld's lemma for schemes

## Academic Publishing: An Insider’s View

Princeton University Press will spearhead a discussion with others in the publishing realm on the current and future state of academic publishing.

*Dilworth Room, Simons Hall 12-2:00 p.m.*

Suggested Audience: IAS Members and Visitors and partners/spouses

Lunch will be provided. To register, click HERE.