On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold - GREYC amacc Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

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.
Fichier principal
Vignette du fichier
dmAG0119.pdf (366.92 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184715 , version 1 (17-08-2015)

Identifiers

Cite

Eda Cesaratto, Alain Plagne, Brigitte Vallée. On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.271-288, ⟨10.46298/dmtcs.3510⟩. ⟨hal-01184715⟩
501 View
505 Download

Altmetric

Share

Gmail Facebook X LinkedIn More