5 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Damien Jamet, Pierre Popoli, Thomas Stoll
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation me…
The sum-of-digits function on arithmetic progressions
Lukas Spiegelhofer, Thomas Stoll
Let be the sum-of-digits function in base , which returns the number of non-zero binary digits of a nonnegative integer . We study alon g arithmetic subsequences…
On subwords in the base- expansion of polynomial and exponential functions
Hajime Kaneko, Thomas Stoll
Let be any word over the alphabet , and denote by either a polynomial of degree or for a fixed . Furthermore, denote by…
A fancy way to obtain the binary digits of
Thomas Stoll
R. L. Graham and H. O. Pollak observed that the sequence has the curious property that the sequence of nu…