English

Geometric Progression-Free Sequences with Small Gaps

Number Theory 2017-07-19 v1 Combinatorics

Abstract

Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free sequences with small gaps, partially answering a question posed originally by Beiglb\"ock et al. Using probabilistic methods we prove the existence of a sequence TT not containing any 66-term geometric progressions such that for any x1x\geq1 and ε>0\varepsilon>0 the interval [x,x+Cεexp((C+ε)logx/loglogx)][x,x+C_{\varepsilon}\exp((C+\varepsilon)\log x/\log\log x)] contains an element of TT, where C=56log2C=\frac{5}{6}\log2 and Cε>0C_{\varepsilon}>0 is a constant depending on ε\varepsilon. As an intermediate result we prove a bound on sums of functions of the form f(n)=exp(dk(n))f(n)=\exp(-d_{k}(n)) in very short intervals, where dk(n)d_{k}(n) is the number of positive kk-th powers dividing nn, using methods similar to those that Filaseta and Trifonov used to prove bounds on the gaps between kk-th power free integers.

Keywords

Cite

@article{arxiv.1501.04121,
  title  = {Geometric Progression-Free Sequences with Small Gaps},
  author = {Xiaoyu He},
  journal= {arXiv preprint arXiv:1501.04121},
  year   = {2017}
}
R2 v1 2026-06-22T08:04:10.949Z