On the longest length of arithmetic progressions
MinZhi Zhao, Huizeng Zhang

TL;DR
This paper investigates the asymptotic behavior of the longest arithmetic progressions and their modular counterparts in random binary sequences, providing distributional limits, error estimates, and almost sure convergence results.
Contribution
It derives the asymptotic distributions and almost sure limits of the longest arithmetic progressions in random sequences, including error bounds using Chen-Stein method.
Findings
Asymptotic distributions of $U^{(n)}$ and $W^{(n)}$ are established.
Error estimates are provided via Chen-Stein method.
Probability that $U^{(n)}$ and $W^{(n)}$ take small fixed values tends to 1 under certain conditions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Coding theory and cryptography
