Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

New bounds for dimensions of a set uniformly avoiding multi-dimensional arithmetic progressions (1910.13071v1)

Published 29 Oct 2019 in math.CA, math.MG, and math.NT

Abstract: Let $r_k(N)$ be the largest cardinality of a subset of ${1,\ldots,N}$ which does not contain any arithmetic progressions (APs) of length $k$. In this paper, we give new upper and lower bounds for fractal dimensions of a set which does not contain $(k,\epsilon)$-APs in terms of $r_k(N)$, where $N$ depends on $\epsilon$. Here we say that a subset of real numbers does not contain $(k,\epsilon)$-APs if we can not find any APs of length $k$ with gap difference $\Delta$ in the $\epsilon \Delta$-neighborhood of the set. More precisely, we show multi-dimensional cases of this result. As a corollary, we find equivalences between multi-dimensional Szemer\'edi's theorem and bounds for fractal dimensions of a set which does not contain multi-dimensional $(k,\epsilon)$-APs.

Summary

We haven't generated a summary for this paper yet.