8 citations · 8 across the 6 of their papers we have counts for
7 papers
A new upper bound to (a variant of) the pancake problem
Zach Hunter
The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation to the identity. We write to denote this quantity. The best…
Corner-free sets via the torus
Zach Hunter
A corner is a triple of points in of the form where . One can think of them as being 2D-analogues to 3-term arithmetic progressions. In…
A short proof that
Zach Hunter
Here we present a short proof that the two-color van der Waerden number is bounded from below by . Previous work has already shown that a superpolynomial lowe…
A note on large induced subgraphs with prescribed residues in bipartite graphs
Zach Hunter
It was proved by Scott that for every , there exists a constant such that for every bipartite -vertex graph without isolated vertices, there exists an induce…
An asymptotically tight lower bound for superpatterns with small alphabets
Zach Hunter
A permutation is a -superpattern (or -universal) if it contains each as a pattern. This notion of "superpatterns" can be generalized to words on smaller…
Multi-Scale Merge-Split Markov Chain Monte Carlo for Redistricting
Eric A. Autry, Daniel Carter, Gregory Herschlag +2
We develop a Multi-Scale Merge-Split Markov chain on redistricting plans. The chain is designed to be usable as the proposal in a Markov Chain Monte Carlo (MCMC) algorithm. Samplin…