A Note on Lower Bounds in Szemer\'edi's Theorem with Random Differences
Number Theory
2025-08-05 v1 Combinatorics
Abstract
In this note, we consider Szemer\'{e}di's theorem on -term arithmetic progressions over finite fields , where the allowed set of common differences in these progressions is chosen randomly of fixed size. Combining a generalization of an argument of Altman with Moshkovitz--Zhu's bounds for the partition rank of a tensor in terms of its analytic rank, we (slightly) improve the best known lower bounds (due to Bri\"et) on the size required for Szemer\'edi's theorem with difference in to hold asymptotically almost surely.
Keywords
Cite
@article{arxiv.2508.01187,
title = {A Note on Lower Bounds in Szemer\'edi's Theorem with Random Differences},
author = {Jason Zheng},
journal= {arXiv preprint arXiv:2508.01187},
year = {2025}
}
Comments
6 pages