English
Related papers

Related papers: Automatic sequences fulfill the Sarnak conjecture

200 papers

We show that the M\"obius disjointess of zero entropy dynamical systems implies the existence of an increasing sequence of positive integers along which the Chowla conjecture on autocorrelations of the M\"obius function holds.

Number Theory · Mathematics 2017-10-20 Alexander Gomilko , Dominik Kwietniak , Mariusz Lemańczyk

We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.

Number Theory · Mathematics 2022-09-21 Jakub Konieczny

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

Number Theory · Mathematics 2016-05-04 Alain Lasjaunias , Jia-Yan Yao

We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are…

Formal Languages and Automata Theory · Computer Science 2018-12-17 Lucas Mol , Narad Rampersad , Jeffrey Shallit , Manon Stipulanti

Basic properties of stationary processes called Sarnak processes are studied. As an application, a combinatorial reformulation of Sarnak's conjecture on M{\"o}bius orthogonality is provided.

Dynamical Systems · Mathematics 2024-04-01 Mariusz Lemańczyk , Michal D. Lemańczyk , Thierry de La Rue

Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

We show that the images via $z\mapsto z^m$ of the continuous part of the spectral measures of the dynamical systems generated by the 0-1 sequences of the Thue-Morse type are pairwise mutually singular for different odd numbers $m\in\N$.…

Dynamical Systems · Mathematics 2013-10-11 El Houcein El Abdalaoui , Stanisław Kasjan , Mariusz Lemańczyk

We show that all $q$-semimultiplicative sequences are asymptotically orthogonal to the M\"obius function, thus proving the Sarnak conjecture for this class of sequences. This generalises analogous results for the sum-of-digits function and…

Number Theory · Mathematics 2018-08-21 Jakub Konieczny

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if the sequence is a realization of a…

Statistics Theory · Mathematics 2008-06-19 L. Györfi , G. Lugosi , G. Morvai

This article is a sequel to a recent article by Eric Rowland and Reem Yassawi, presenting yet another approach to the fast determination of congruence properties of `famous' combinatorial sequences. The present approach can be taught to a…

Combinatorics · Mathematics 2014-08-05 Eric Rowland , Doron Zeilberger

Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic sequences) do not necessarily share. In this paper we survey a number of different methods that can be used to prove that a given sequence…

Number Theory · Mathematics 2021-04-28 J. -P. Allouche , J. Shallit , R. Yassawi

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…

Machine Learning · Statistics 2008-12-11 Finn Macleod , James Gleeson

An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…

Number Theory · Mathematics 2020-10-05 J. -P. Allouche , F. M. Dekking , M. Queffélec

We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…

Number Theory · Mathematics 2017-09-06 Leonard E. Baum

We show that Sarnak's conjecture on M\"obius disjointness holds for all subshifts given by bijective substitutions and some other similar dynamical systems, e.g.\ those generated by Rudin-Shapiro type sequences.

Dynamical Systems · Mathematics 2015-07-15 S. Ferenczi , J. Kułaga-Przymus , M. Lemańczyk , C. Mauduit

Assuming the existence of Siegel zeros, we prove that there exists an increasing sequence of positive integers for which Chowla's Conjecture on $k$-point correlations of the Liouville function holds. This extends work of Germ\'an and…

Number Theory · Mathematics 2021-06-01 Jake Chinis

Sarnak's M\"{o}bius disjointness conjecture asserts that for any zero entropy dynamical system $(X,T)$, $\frac{1}{N} \sum_{n=1} ^N f(T^n x) \mu (n)= o(1)$ for every $f\in \mathcal{C}(X)$ and every $x\in X$. We construct examples showing…

Dynamical Systems · Mathematics 2022-02-22 Amir Algom , Zhiren Wang

It is shown that Sarnak's M\"{o}bius orthogonality conjecture is fulfilled for the compact metric dynamical systems for which every invariant measure has singular spectra. This is accomplished by first establishing a special case of Chowla…

Dynamical Systems · Mathematics 2020-06-16 el Houcein el Abdalaoui , Mahesh Nerurkar

We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…

Number Theory · Mathematics 2024-04-12 Jakub Konieczny

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Formal Languages and Automata Theory · Computer Science 2011-10-14 Emilie Charlier , Narad Rampersad , Jeffrey Shallit
‹ Prev 1 2 3 10 Next ›