Arithmetic progressions in the graphs of slightly curved sequences

MaRDI QIDQ3120416zbMATH OpenFDO

Authors Kota Saito, Yuuya Yoshida

Publication date 4 March 2019

Full work available at URL https://arxiv.org/abs/1807.06971, https://cs.uwaterloo.ca/journals/JIS/VOL22/Yoshida/yoshida4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

arithmetic progressionGowers' upper boundPiatetski-Shapiro sequenceSzemerédi's theoremvan der Waerden number

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^{a}lpha$ for some $alpha>0$. In this paper, we prove that arbitrarily long arithmetic progressions are contained in the graph of a slightly curved sequence with small error. Furthermore, we extend Szemer'edi's theorem to a theorem about slightly curved sequences. As a corollary, it follows that the graph of the sequence ${lfloor{n}^{a}floor}_{ninA}$ contains arbitrarily long arithmetic progressions for every $1lea<2$ and every $AsubsetmathbbN$ with positive upper density. Using this corollary, we show that the set $$p$$ contains arbitrarily long arithmetic progressions for every $1lea<2$ and $b>1$. We also prove that, for every $age2$, the graph of ${lfloor{n}^{a}floor}_{n=1}^{i}nfty$ does not contain any arithmetic progressions of length $3$.

Recommendations

• Integer Sum Sets Containing Long Arithmetic Progressions
• A Hardy field extension of Szemerédi's theorem
• Sequences with Many Primes
• Progressions in sequences of nearly consecutive integers
• Near arithmetic progressions in sparse sets

Cites work

• A new proof of Szemerédi's theorem
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• Avoiding three consecutive blocks of the same size and same sum
• History of the theory of numbers. Vol. I: Divisibility and primality. Vol. II: Diophantine analysis. Vol. III: Quadratic and higher forms.
• scientific article; zbMATH DE number 1090401 (Why is no real title available?)
• scientific article; zbMATH DE number 3385632 (Why is no real title available?)
• scientific article; zbMATH DE number 3084443 (Why is no real title available?)
• Large sets containing copies of small sets
• Multiplicative number theory. I. Classical theory
• New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
• On sets of integers containing k elements in arithmetic progression
• Prime numbers of the form \([n^2]\)
• Roth's theorem in the Piatetski-Shapiro primes
• The \(n\)-th prime asymptotically
• The primes contain arbitrarily long arithmetic progressions
• Über die diophantische Gleichung \(x^l+y^l=c z^l\)

Cited in

(8)

• Distributions of finite sequences represented by polynomials in Piatetski-Shapiro sequences
• Arithmetic progressions on Huff curves
• Linear Diophantine equations in Piatetski-Shapiro sequences
• A system of certain linear Diophantine equations on analogs of squares
• On classification of sequences containing arbitrarily long arithmetic progressions
• Density combinatorics theorems in fractal dimension theory of continued fractions
• The Green-Tao theorem for Piatetski-Shapiro primes
• Additive Ramsey theory over Piatetski-Shapiro numbers

This page was built for publication: Arithmetic progressions in the graphs of slightly curved sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120416)