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

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

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 progressi...

Full description

Bibliographic Details
Main Authors: Eda Cesaratto, Alain Plagne, Brigitte Vallée
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2006-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
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]
Online Access:https://dmtcs.episciences.org/3510/pdf

Internet

https://dmtcs.episciences.org/3510/pdf

Similar Items