| Issue |
RAIRO-Theor. Inf. Appl.
Volume 50, Number 1, January-March 2016
Special issue dedicated to the 15th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 93 - 99 | |
| DOI | https://doi.org/10.1051/ita/2016009 | |
| Published online | 02 June 2016 | |
On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence∗
1
Université de Lorraine, Institut Elie Cartan de Lorraine, UMR 7502,
54506
Vandœuvre-lès-Nancy,
France
2
CNRS, Institut Elie Cartan de Lorraine, UMR 7502,
54506
Vandœuvre-lès-Nancy,
France
thomas.stoll@univ-lorraine.fr
Received: 24 March 2016
Accepted: 24 March 2016
Let P(x) ∈ ℤ [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 ≥ N0(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.
Mathematics Subject Classification: 11A63 / 11B85
Key words: Rudin–Shapiro sequence / automatic sequences / polynomials
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.