T. Stoll

activity

20092020

collaborators

4 papers

math.CO2020

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

Irène Marcovici, Thomas Stoll, Pierre-Adrien Tahay

We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$ th term of the sequence as being…

math.NT2019

The sum-of-digits function on arithmetic progressions

Lukas Spiegelhofer, Thomas Stoll

Let $s_{2}$ be the sum-of-digits function in base $2$ , which returns the number of non-zero binary digits of a nonnegative integer $n$ . We study $s_{2}$ alon g arithmetic subsequences…

math.NT2017

On subwords in the base- $q$ expansion of polynomial and exponential functions

Hajime Kaneko, Thomas Stoll

Let $w$ be any word over the alphabet ${0, 1, \dots, q - 1}$ , and denote by $h$ either a polynomial of degree $d \geq 1$ or $h : n \mapsto m^{n}$ for a fixed $m$ . Furthermore, denote by…

math.NT2009

A fancy way to obtain the binary digits of $7592501252$

Thomas Stoll

R. L. Graham and H. O. Pollak observed that the sequence $u_{1} = 1, u_{n + 1} = ⌊ 2 (u_{n} + 1/2)⌋, n \geq 1,$ has the curious property that the sequence of nu…

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

The sum-of-digits function on arithmetic progressions

On subwords in the base-q expansion of polynomial and exponential functions

A fancy way to obtain the binary digits of 7592501252​

On subwords in the base- $q$ expansion of polynomial and exponential functions

A fancy way to obtain the binary digits of $7592501252$