activity
20092021
most citedMaximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences

5 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

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 th term of the sequence as being…