activity
20082020
most citedSubstitutions and Möbius disjointness

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

collaborators

6 papers

math.NT2020

Möbius orthogonality of sequences with maximal entropy

Michael Drmota, Christian Mauduit, Joël Rivat +1

We prove that strongly -multiplicative functions of modulus along squares are asymptotically orthogonal to the Möbius function. This provides examples of sequences having ma…

math.DS2018

An algorithm for the word entropy

Carlos Gustavo Moreira, Christian Mauduit, Sébastien Ferenczi

For any infinite word on a finite alphabet , the complexity function of is the sequence counting, for each non-negative , the number of words of length…

math.DS2018

Entropy ratio for infinite sequences with positive entropy

C. Mauduit, C. -G. Moreira

The complexity function of an infinite word on a finite alphabet is the sequence counting, for each non-negative , the number of words of length on the alphabet …

math.DS2017★ 1 cited

Complexity and fractal dimensions for infinite sequences with positive entropy

Carlos Gustavo Moreira, Christian Mauduit

The complexity function of an infinite word on a finite alphabet is the sequence counting, for each non-negative , the number of words of length on the alphabet …

math.DS2015★ 5 cited

Substitutions and Möbius disjointness

S. Ferenczi, J. Kułaga-Przymus, M. Lemańczyk +1

We show that Sarnak's conjecture on Möbius disjointness holds for all subshifts given by bijective substitutions and some other similar dynamical systems, e.g.\ those generated by…

cs.DM2008★ 1 cited

Asymptotic behavior of growth functions of D0L-systems

Julien Cassaigne, Christian Mauduit, Francois Nicolas

A D0L-system is a triple (A, f, w) where A is a finite alphabet, f is an endomorphism of the free monoid over A, and w is a word over A. The D0L-sequence generated by (A, f, w) is…