An improved lower bound related to the Furstenberg-Sárközy theorem
Mark Lewko · The Electronic Journal of Combinatorics · 2015
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2015
Abstract
Let $D(n)$ denote the cardinality of the largest subset of the set $\{1,2,\ldots,n\}$ such that the difference of no pair of distinct elements is a square. A well-known theorem of Furstenberg and Sárközy states that $D(n)=o(n)$. In the other direction, Ruzsa has proven that $D(n) \gtrsim n^{\gamma}$ for $\gamma = \frac{1}{2}\left( 1 + \frac{\log 7}{\log 65} \right) \approx 0.733077$. We improve this to $\gamma = \frac{1}{2}\left( 1 + \frac{\log 12}{\log 205} \right) \approx 0.733412$.
Open the resolved locator · 10.37236/4656
Metadata licence: OpenAlex metadata (CC0)