Papers:
On sumsets containing a perfect square Zachary Chase preprint
New upper bounds for trace reconstruction Zachary Chase, preprint [blog post]
A new upper bound for separating words Zachary Chase, preprint [blog post]
Separating words and trace reconstruction is a combined version of the above two papers.
STOC 2021, best student paper award, invited to STOC special issue of SICOMP.
A random analogue of Gilbreath's conjecture Zachary Chase, preprint [blog post]
A proof of the Gan-Loh-Sudakov conjecture Zachary Chase, Advances in Combinatorics [editorial introduction]
New lower bounds for trace reconstruction Zachary Chase, Ann. Inst. Henri Poincaré Probab. Stat.
Additive conjugacy and the Bohr compactification of orthogonal representations Zachary Chase, Wade Hann-Caruthers, Omer Tamuz Mathematische Annalen.
Other papers:
The maximum number of three term arithmetic progressions, and triangles in Cayley graphs Zachary Chase, preprint
On the iterates of digit maps Zachary Chase, Integers
Experimental evidence for asymptotic non-optimality of comb adversary strategy Zachary Chase, preprint
Learning time dependent choice Zachary Chase, Siddharth Prasad, ITCS 2019
Polynomial methods and incidence theory (page 52) Adam Sheffer, Cambridge University press