Application of a method of Szemeredi (Q3695346)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3918484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Application of a method of Szemeredi |
scientific article; zbMATH DE number 3918484 |
Statements
Application of a method of Szemeredi (English)
0 references
1985
0 references
B-free integers
0 references
Erdős-Szemerédi theorem
0 references
upper bound
0 references
arithmetic progression
0 references
0.83177567
0 references
0.81286454
0 references
0.8124407
0 references
0.80503595
0 references
Let \(B=\{b_ i: b_ 1<b_ 2<...\}\) be an infinite sequence of positive integers that exceed 1 and are pairwise coprime i.e. \((b_ i,b_ j)=1\) for \(i\neq j\). Assume also that \(\sum^{\infty}_{i=1}1/b_ i\) is convergent. Let A denote the sequence of natural numbers divisible by no element of B. Erdős was the first to introduce this sequence and he proved that there exists a constant c \((0<c<1)\) independent of B such that the interval \((x,x+x^ c)\) contains an element of A provided x is large enough. The constant c was improved to \(+\epsilon\) by Szemerédi. The latest improvement is \(9/20+\epsilon\) due to \textit{G. Bantle} and \textit{F. Grupp}. The author considers here the upper bound for the least number in A in an arithmetic progression h (mod k). The result is the neat and interesting upper bound \(k^{2+\epsilon}\) for \(k\geq k_ 0(\epsilon,B)\). Actually the author obtains a lower bound for the number of numbers in A which do not exceed \(k^{2+\epsilon}\) and belong to the arithmetic progression h (mod k).
0 references