5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.NT2021★ 5 cited
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…
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…