Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Substitutions in dynamics, arithmetics, and combinatorics

- V. Berthé, S. Ferenczi, C. Mauduit, A. Siegel
- Mathematics
- 2002

Basic notions on substitutions.- Basic notions on substitutions.- Arithmetics and combinatorics of substitutions.- Substitutions, arithmetic and finite automata: an introduction.- Automatic sequences… Expand

650 31

On Finite Pseudorandom Binary Sequences

- C. Mauduit
- 1998

Special finite binary sequences are tested for pseudorandomness. As measures of pseudorandomness, well-distribution relative to arithmetic progressions and small (auto)correlation are used. These… Expand

104 24- PDF

On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol

- C. Mauduit, A. Sárközy
- Mathematics
- 1997

On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) and András Sárközy (Budapest) 1. Introduction. In the last 60 years… Expand

219 13- PDF

Transcendence of Numbers with a Low Complexity Expansion

- S. Ferenczi, C. Mauduit
- Mathematics
- 1 December 1997

Abstract A sequence is Sturmian if it has complexity n + l −1, that is, n + l −1 factors of length n for every n ; we show that real numbers whose expansion in some base k ⩾ l is Sturmian are… Expand

97 13

On finite pseudorandom binary sequences VII: The measures of pseudorandomness

- J. Cassaigne, C. Mauduit, A. Sárközy
- Mathematics
- 2002

where the maximum is taken over all D = (d1, . . . , dk) and M such that M + dk ≤ N . 2000 Mathematics Subject Classification: Primary 11K45.

115 9

A complexity measure for families of binary sequences

- R. Ahlswede, L. H. Khachatrian, C. Mauduit, A. Sárközy
- Mathematics, Computer Science
- Period. Math. Hung.
- 1 June 2003

TLDR

40 9- PDF

Prime numbers along Rudin–Shapiro sequences

- C. Mauduit, J. Rivat
- Mathematics
- 29 October 2015

For a large class of digital functions f, we estimate the sums Sigma(n <= x) Lambda(n)f (n) (and Sigma(n <= x) mu(n)f (n)), where Lambda denotes the von Mangoldt function (and mu, the Mobius… Expand

44 7- PDF

Construction of large families of pseudorandom binary sequences

- L. Goubin, C. Mauduit, A. Sárközy
- Mathematics
- 1 May 2004

Abstract In a series of papers Mauduit and Sarkozy (partly with coauthors) studied finite pseudorandom binary sequences. They showed that the Legendre symbol forms a “good” pseudorandom sequence, and… Expand

71 6- PDF

Measures of pseudorandomness for finite sequences: typical values

- N. Alon, Y. Kohayakawa, C. Mauduit, C. Moreira, V. Rödl
- Mathematics
- 1 November 2007

Mauduit and Sárközy introduced and studied certain numerical parameters associated to finite binary sequences EN ∈ {−1, 1}N in order to measure their ‘level of randomness’. Those parameters, the… Expand

62 6- PDF

...

1

2

3

4

5

...