Zach Hunter

activity

20192023

most citedMulti-Scale Merge-Split Markov Chain Monte Carlo for Redistricting

8 citations · 11 across the 15 of their papers we have counts for

collaborators

Showing 2022Show all

4 papers · 1 filter

math.CO2022

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 $π \in S_{k}$ to the identity. We write $f (k)$ to denote this quantity. The best…

math.CO2022

Corner-free sets via the torus

Zach Hunter

A corner is a triple of points in $Z^{2}$ of the form $(x, y), (x + d, y), (x, y + d)$ where $d \neq = 0$ . One can think of them as being 2D-analogues to 3-term arithmetic progressions. In…

math.CO2022

A short proof that $w (3, k) \geq (1 - o (1)) k^{2}$

Zach Hunter

Here we present a short proof that the two-color van der Waerden number $w (3, k)$ is bounded from below by $(1 - o (1)) k^{2}$ . Previous work has already shown that a superpolynomial lowe…

math.CO2022

A note on large induced subgraphs with prescribed residues in bipartite graphs

Zach Hunter

It was proved by Scott that for every $k \geq 2$ , there exists a constant $c (k) > 0$ such that for every bipartite $n$ -vertex graph $G$ without isolated vertices, there exists an induce…

A new upper bound to (a variant of) the pancake problem

Corner-free sets via the torus

A short proof that w(3,k)≥(1−o(1))k2

A note on large induced subgraphs with prescribed residues in bipartite graphs

A short proof that $w (3, k) \geq (1 - o (1)) k^{2}$