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

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2009

On the fixed point of the iterated pseudopalindromic closure

D. Jamet, G. Paquin, G. Richomme +1

First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words wit…