On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold

Abstract

We solve a problem by V. I. Arnold dealing with "how random" modular arithmetic progressions can be. After making precise how Arnold proposes to measure the randomness of a modular sequence, we show that this measure of randomness takes a simplified form in the case of arithmetic progressions. This simplified expression is then estimated using the methodology of dynamical analysis, which operates with tools coming from dynamical systems theory. In conclusion, this study shows that modular arithmetic progressions are far from behaving like purely random sequences, according to Arnold's definition.

Keywords

• transfer operators
• dynamical analysis
• arnold's problems
• bounds à la dolgopyat
• perron formula
• dirichlet series
• modular arithmetic progressions
• [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
• [math.math-co] mathematics [math]/combinatorics [math.co]
• [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]