English

Sharp bounds for the Tao-Vu Discrete John's Theorem

Combinatorics 2023-09-25 v1

Abstract

Tao and Vu showed that every centrally symmetric convex progression CZdC\subset\mathbb{Z}^d is contained in a generalised arithmetic progression of size dO(d2)#Cd^{O(d^2)} \# C. Berg and Henk improved the size bound to dO(dlogd)#Cd^{O(d\log d)} \# C. We obtain the bound dO(d)#Cd^{O(d)} \# C, which is sharp up to the implied constant, and is of the same form as the bound in the continuous setting given by John's Theorem.

Cite

@article{arxiv.2309.12386,
  title  = {Sharp bounds for the Tao-Vu Discrete John's Theorem},
  author = {Peter van Hintum and Peter Keevash},
  journal= {arXiv preprint arXiv:2309.12386},
  year   = {2023}
}

Comments

2 pages

R2 v1 2026-06-28T12:28:46.724Z