English
Related papers

Related papers: Automatic sequences fulfill the Sarnak conjecture

200 papers

The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…

General Mathematics · Mathematics 2022-10-06 Raghavendra Bhat

This paper examines Automatic Complexity, a complexity notion introduced by Shallit and Wang in 2001. We demonstrate that there exists a normal sequence $T$ such that $I(T) = 0$ and $S(T) \leq 1/2$, where $I(T)$ and $S(T)$ are the lower and…

Formal Languages and Automata Theory · Computer Science 2021-11-30 Liam Jordon , Philippe Moser

A large class of problems in sciences and engineering can be formulated as the general problem of constructing random intervals with pre-specified coverage probabilities for the mean. Wee propose a general approach for statistical inference…

Statistics Theory · Mathematics 2013-06-11 Xinjia Chen

We provide a complete characterisation of automaticity of uniformly recurrent substitutive sequences in terms of the incidence matrix of the return substitution of the underlying purely substitutive sequence. This resolves a recent question…

Number Theory · Mathematics 2026-02-17 Elżbieta Krawczyk , Clemens Müllner

In 2017 Tao proposed a variant Sarnak's M\"{o}bius disjointness conjecture with logarithmic averaging: For any zero entropy dynamical system $(X,T)$, $\frac{1}{\log N} \sum_{n=1} ^N \frac{f(T^n x) \mu (n)}{n}= o(1)$ for every $f\in…

Dynamical Systems · Mathematics 2024-06-12 Amir Algom , Zhiren Wang

Within the context of the binomial model, we analyse sequences of values that are almost-uniform and we discuss a prediction method called the frequent outcome approach, in which the outcome that has occurred the most in the observed trials…

Statistics Theory · Mathematics 2022-09-29 Ben O'Neill

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

Statistical Mechanics · Physics 2007-05-23 Saul Ares , Mario Castro

We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than guaranteed by the Arithmetic Regularity Lemma. For sequences produced by strongly…

Number Theory · Mathematics 2023-05-25 Jakub Byszewski , Jakub Konieczny , Clemens Müllner

We formulate several analogues of the Chowla and Sarnak conjectures, which are widely known in the setting of the M\"obius function, in the setting of Kloosterman sums. We then show that for Kloosterman sums, in some cases, these…

Number Theory · Mathematics 2023-10-05 E. H. El Abdalaoui , I. E. Shparlinski , R. S. Steiner

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

Computer Science and Game Theory · Computer Science 2007-05-23 Thierry Cachat

In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…

Formal Languages and Automata Theory · Computer Science 2022-12-20 Jean-Paul Allouche , Michel Mendès France

Motivated by Sarnak's conjecture on M\"obius orthogonality, we investigate the general problem of orthogonality for a bounded sequence to topological models of characteristic classes of measure-preserving automorphisms. Our main observation…

Dynamical Systems · Mathematics 2026-04-24 J. Aaronson , A. I. Danilenko , J. Kułaga-Przymus , M. Lemańczyk

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

Formal Languages and Automata Theory · Computer Science 2018-07-24 Michel Rigo , Robert Underwood

Let $(X, T)$ be a topological dynamical system. We show that if each invariant measure of $(X, T)$ gives rise to a measure-theoretic dynamical system that is either: a. rigid along a sequence of "bounded prime volume" or b. admits a…

Dynamical Systems · Mathematics 2024-03-19 Adam Kanigowski , Mariusz Lemańczyk , Maksym Radziwiłł

Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…

General Mathematics · Mathematics 2025-07-02 Arnaud Mayeux

We provide a criterion for a point satisfying the required disjointness condition in Sarnak's M\"obius Disjointness Conjecture. As a direct application, we have that the conjecture holds for any topological model of an ergodic system with…

Dynamical Systems · Mathematics 2016-09-12 Wen Huang , Zhiren Wang , Guohua Zhang

The purpose of this article is a set-indexed extension of the well-known Ornstein-Uhlenbeck process. The first part is devoted to a stationary definition of the random field and ends up with the proof of a complete characterization by its…

Probability · Mathematics 2013-08-29 Paul Balança , Erick Herbin

The M\"obius disjointness conjecture of Sarnak states that the M\"obius function does not correlate with any bounded sequence of complex numbers arising from a topological dynamical system with zero topological entropy. We verify the…

Number Theory · Mathematics 2019-02-05 Nikos Frantzikinakis , Bernard Host

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding M\"obius prime-function, which in the limit of infinitely large primes becomes identical to the original M\"obius function.…

General Mathematics · Mathematics 2011-09-28 R. M. Abrarov , S. M. Abrarov