Hello! My name is Zachary Chase, and I research mathematics, theoretical computer science, and the foundations of machine learning. I am currently a Postdoc at Kent State University working with Fedor Nazarov.

I completed my PhD in mathematics at the University of Oxford, advised by Ben Green.

I am currently on the academic job market, 2025-2026.




ME

Selected publications:

Optimal mistake bounds for transductive online learning NeurIPS 2025, best paper runner up

              with Steve Hanneke, Shay Moran, and Jonathan Shafer

Replicability and stability in learning FOCS 2023

              with Shay Moran and Amir Yehudayoff

Separating words and trace reconstruction STOC 2021, best student paper

              New upper bounds for trace reconstruction [blog post]

              A new upper bound for separating words [blog post]

A random analogue of Gilbreath's conjecture Math. Ann. [blog post]

A proof of the Gan-Loh-Sudakov conjecture Advances in Combinatorics

Papers:

A tight lower bound for non-stochastic multi-armed bandits with expert advice preprint

              with Idan Mehalel

On the length of Pierce expansions preprint

              with Mayank Pandey

On sumsets containing a perfect square preprint

Deterministic apple tasting COLT 2025

              with Idan Mehalel

Dual VC dimension obstructs sample compression by embeddings COLT 2024

              with Bogdan Chornomaz, Steve Hanneke, Shay Moran, and Amir Yehudayoff

Local Borsuk-Ulam, stability, and replicability STOC 2024

              with Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff

On the smallest gap in a sequence with Poisson pair correlations CPC

              with Dan Altman

New lower bounds for trace reconstruction Ann. Inst. Henri Poincaré Probab. Stat.

Additive conjugacy and the Bohr compactification of orthogonal representations Math. Ann.

              with Wade Hann-Caruthers and Omer Tamuz

Other Papers:

Approximate union closed conjecture preprint

              with Shachar Lovett

The maximum number of three term arithmetic progressions, and triangles in Cayley graphs preprint

On the iterates of digit maps Integers

Experimental evidence for asymptotic non-optimality of comb adversary strategy preprint

Learning time dependent choice ITCS 2019

              with Siddharth Prasad


Construction Work:

Gaussian analytic functions and operator symbols of dirichlet type Haakan Hedenmalm, Serguei Shimorin, Advances in Mathematics

Artwork:

Polynomial methods and incidence theory (page 52) Adam Sheffer, Cambridge University Press