English

S\'ark\"ozy's Theorem for Fractional Monomials

Number Theory 2024-11-19 v2 Combinatorics

Abstract

Suppose AA is a subset of {1,,N}\{1, \dotsc, N\} which does not contain any configurations of the form x,x+ncx,x+\lfloor n^c \rfloor where n0n \neq 0 and 1<c<651<c<\frac{6}{5}. We show that the density of AA relative to the first NN integers is Oc(N165c)O_c(N^{1-\frac{6}{5c}}). More generally, given a smooth and regular real valued function hh with "growth rate" c(1,65)c \in (1,\frac{6}{5}), we show that if AA lacks configurations of the form x,x±h(n)x,x \pm \lfloor h(n) \rfloor then ANh,εN165c+ε\frac{|A|}{N} \ll_{h,\varepsilon} N^{1-\frac{6}{5c}+\varepsilon} for any ε>0\varepsilon>0.

Keywords

Cite

@article{arxiv.2411.07386,
  title  = {S\'ark\"ozy's Theorem for Fractional Monomials},
  author = {Maximilian O'Keeffe},
  journal= {arXiv preprint arXiv:2411.07386},
  year   = {2024}
}

Comments

13 pages; typos corrected; the results of this paper improve on a bound proved by S\'ark\"ozy and Rivat for a certain range of $c$, this is discussed in subsection 1.3