De Thomas Stoll
Apparaît dans la collection : Jean-Morlet Chair 2020 - Conference: Diophantine Problems, Determinism and Randomness / Chaire Jean-Morlet 2020 - Conférence : Problèmes diophantiens, déterminisme et aléatoire
We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the nth term of the sequence as being the total weight of the integer n written in base k. Under an additional combinatorial difference condition on the weight function, these sequences can be interpreted as generalised Rudin–Shapiro sequences. We prove that these sequences have the same two-term correlations as sequences of symbols chosen uniformly and independently at random. The speed of convergence is independent of the prime factor decomposition of k. This extends work by E. Grant, J. Shallit, T. Stoll, and by P.-A. Tahay.
De Ana Caraiani
De Valentin Ovsienko
![[1239] The geometrization of the local Langlands correspondence, after Fargues and Scholze](/media/cache/video_light/uploads/video/Bourbaki.png)
