** Professor of Mathematics **

*Research Interests: *Analysis, combinatorics

## Publications

A bilinear version of Bogolyubov's theorem

– Proceedings of the American Mathematical Society

(2020)

148,

4695

(DOI: 10.1090/proc/15129)

A uniform set with fewer than expected arithmetic progressions of length 4

– Acta Mathematica Hungarica

(2020)

161,

756

(DOI: 10.1007/s10474-020-01072-z)

Improved bounds for the Erdős-Rogers function

– Advances in Combinatorics

(2020)

(DOI: 10.19086/aic.12048)

Subsets of Cayley Graphs That Induce Many Edges

– Theory of Computing

(2019)

15,

1

(DOI: 10.4086/toc.2019.v015a020)

Perverse incentives: How the reward structures of academia impede scholarly communication and good science

– Septentrio Conference Series

(2017)

(DOI: 10.7557/5.4267)

Freiman homomorphisms on sparse random sets

– The Quarterly Journal of Mathematics

(2017)

68,

275

(DOI: 10.1093/qmath/haw058)

Inverse and stability theorems for approximate representations of finite groups

– Sbornik: Mathematics

(2017)

208,

1784

(DOI: 10.1070/SM8872)

Probabilistic combinatorics and the recent work of Peter Keevash

– Bulletin of the American Mathematical Society

(2017)

54,

107

(DOI: 10.1090/bull/1553)

The multiparty communication complexity of interleaved group products

– 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS)

(2016)

289

(DOI: 10.1109/FOCS.2016.39)

- 1 of 9