Paperlane

no. 15 · Monday 16 November 2026

A $19/5$ lower bound for the four-dimensional Erdős box problem

Dean Matthew Menezes

math.CO · 5 pp

Abstract

For every power $q\ge2$ of~$2$, we construct a box-free subset of $[q^5]^4$ with $q^{19}$ points, improving the lower-bound exponent in the four-dimensional Erdős box problem from $15/4$ to $19/5$. In fact, $[q^5]^4$ partitions into $q$ isomorphic box-free sets. The proof uses a finite-field rectangle lemma and orthogonality in a four-dimensional bilinear space. We also deduce a uniform bound $f_4(n)\ge2^{-19/20}n^{19/5}$ and a lower bound for grid-coloring numbers.

comments
5 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.17378 ↗