On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Année : 2016

On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence

Sur le blocs digitaux des valeurs polynomiales et extractions dans la suite de Rudin--Shapiro

Thomas Stoll

Résumé

Let P (x) ∈ Z[x] be an integer-valued polynomial taking only positive values and let d be a fixed positive integer. The aim of this short note is to show, by elementary means, that for any sufficiently large integer N ≥ N_0(P, d) there exists n such that P(n) contains exactly N occurrences of the block (q − 1, q − 1,... , q − 1) of size d in its digital expansion in base q. The method of proof allows to give a lower estimate on the number of " 0 " resp. " 1 " symbols in polynomial extractions in the Rudin–Shapiro sequence.
Fichier principal
Vignette du fichier
rudin-ita2-art.pdf (273.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01278708 , version 1 (24-02-2016)

Identifiants

Citer

Thomas Stoll. On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2016, 50 (1), pp.93-99. ⟨10.1051/ita/2016009⟩. ⟨hal-01278708⟩
149 Consultations
145 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More