On the maximal length of arithmetic progressions
From MaRDI portal
Abstract: Suppose that are i.i.d with . Let and be the longest length of arithmetic progressions and of arithmetic progressions mod relative to respectively. Firstly, the asymptotic distributions of and are given. Simultaneously, the errors are estimated by using Chen-Stein method. Next, the almost surely limits are discussed when all are equal and when considered on a common probability space. Finally, we consider the case that and . We prove that as tends to , the probability that takes two numbers and takes three numbers tends to 1.
The goal of this paper is to study the asymptotic distribution of the maximal arithmetic progressions in random subsets. The authors also give the estimation of distribution approximations by using the Chen-Stein method. Then the almost sure limit behaviour of this statistics is discussed.
Recommendations
- On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors
- On the length of arithmetic progressions in linear combinations of S-units
- scientific article; zbMATH DE number 4177149
- scientific article; zbMATH DE number 2203980
- Maximal arithmetic progressions in random subsets
- On classification of sequences containing arbitrarily long arithmetic progressions
- On the longest length of consecutive integers
- scientific article; zbMATH DE number 3300652
- Long arithmetic progressions in sumsets: Thresholds and bounds
Cited in
(5)
This page was built for publication: On the maximal length of arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388966)