No CrossRef data available.
Article contents
Sharp bounds for a discrete John’s theorem
Published online by Cambridge University Press: 05 March 2024
Abstract
Tao and Vu showed that every centrally symmetric convex progression $C\subset \mathbb{Z}^d$ is contained in a generalized arithmetic progression of size $d^{O(d^2)} \# C$. Berg and Henk improved the size bound to $d^{O(d\log d)} \# C$. We obtain the bound $d^{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.
MSC classification
- Type
- Paper
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press