On acknowledgments | My CV and research statement | Contact me
Hello! I am currently a third year undergraduate student at Oxford. My main research interests are in extremal and probabilistic combinatorics, often involving graph theory, Ramsey theory, or pattern containment. I also am interested in discrete geometry and additive combinatorics, although I have yet to publish much on these yet.
Email: zachary.hunter at exeter.ox.ac.uk -- I welcome any questions/comments about my work.
- A note on large induced subgraphs with prescribed residues in bipartite graphs, Arxiv.
- Optimally reconstructing caterpillar graphs, Arxiv.
- Improved lower bounds for van der Waerden numbers, Arxiv, Quanta article, accepted to Combinatorica.
- An asymptotically tight lower bound for superpatterns with small alphabets, Arxiv.
- Metropolized Multiscale Forest Recombination for Redistricting (with Eric Autry, Daniel Carter, Gregory Herschlag, and Jonathan Mattingly), Arxiv, in Multiscale Modeling & Simulation.
- A Merge-Split Proposal for Reversible Monte Carlo Markov Chain Sampling of Redistricting Plans (with Eric Autry, Daniel Carter, Gregory Herschlag, and Jonathan Mattingly), Arxiv.
- Optimal Legislative County Clustering in North Carolina (with Daniel Carter, Dan Teague, Gregory Herschlag, and Jonathon Mattingly), Arxiv, in Statistics and Public Policy.
- Corner-free sets via the torus, Overleaf.
- A new upper bound to (a variant of) the pancake problem, Overleaf.
- A new lower bound for superpermutations, Overleaf.
- A new upper bound for superpatterns, Overleaf.
- Shorter Super-Trees using Dyadic Sequence Dominators, Overleaf.