## Regularity Lemmas and Other Extremal Results

Guy Moshkovitz

Member, School of Mathematics

October 1, 2018

Guy Moshkovitz

Member, School of Mathematics

October 1, 2018

Viswambhara Makam

University of Michigan; Member, School of Mathematics

October 1, 2018

Robin Neumayer

Northwestern University; Member, School of Mathematics

October 1, 2018

Avishay Tal

University of California, Berkeley

October 1, 2018

In their seminal paper, Bennett, Bernstein, Brassard and Vazirani [SICOMP, 1997] showed that relative to an oracle, quantum algorithms are unable to solve NP-complete problems in sub-exponential time (i.e., that Grover's search is optimal in this setting).

Franco Vargas Pallete

University of California, Berkeley; Member, School of Mathematics

September 28, 2018

Nathaniel Bottman

Member, School of Mathematics

September 28, 2018

Clemens Koppensteiner

Member, School of Mathematics

September 28, 2018

Yevgeny Liokumovich

Massachusetts Institute of Technology; Member, School of Mathematics

September 28, 2018

Daniel Litt

Columbia University; Member, School of Mathematics

September 28, 2018

Charlotte Chan

Princeton University

September 27, 2018

The seminal work of Deligne and Lusztig on the representations of finite reductive groups has influenced an industry studying parallel constructions in the same theme. In this talk, we will discuss recent progress on studying analogues of Deligne--Lusztig varieties attached to p-adic groups.