Searcharxiv⌕ Search

arXiv subjects

Jean-Paul Allouche

Publications and source records attributed to Jean-Paul Allouche.

40 records · Page 3Linked to original sources

A note on univoque self-Sturmian numbers

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of a unimodal continuous map from the unit interval into itself, but it also characterizes univoque real numbers; the other is an equivalent definition of characteristic Sturmian sequences. As a corollary to our study we obtain that a real number $β$ in $(1,2)$ is univoque and self-Sturmian if and only if the $β$-expansion of 1 is of the form $1v$, where $v$ is a characteristic Sturmian sequence beginning itself in 1.

math.NT↗

On a conjecture of Deutsch, Sagan, and Wilson

We prove a recent conjecture due to Deutsch, Sagan, and Wilson stating that the finite sequence obtained from the first p central trinomial coefficients modulo p by replacing nonzero terms by 1's is palindromic, for any prime number p > 3. Addendum: the result was proved before almost in the same way by Tony D. Noe: On the Divisibility of Generalized Central Trinomial Coefficients, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.7 http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Noe/noe35.html

math.NT↗

Summation of Series Defined by Counting Blocks of Digits

We discuss the summation of certain series defined by counting blocks of digits in the $B$-ary expansion of an integer. For example, if $s_2(n)$ denotes the sum of the base-2 digits of $n$, we show that $\sum_{n \geq 1} s_2(n)/(2n(2n+1)) = (γ+ \log \frac{4}π)/2$. We recover this previous result of Sondow in math.NT/0508042 and provide several generalizations.

math.NT↗

Palindrome complexity

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to the class P substitutions of Hof-Knill-Simon. We also give an upper bound for the palindrome complexity of a sequence in terms of its (block-)complexity.

math.CO↗