Related papers: Automatic sequences, generalised polynomials, and …
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…
We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) =…
The aim of this short note is to generalise the result of Rampersad--Shallit saying that an automatic sequence and a Sturmian sequence cannot have arbitrarily long common factors. We show that the same result holds if a Sturmian sequence is…
A theorem of Christol states that a power series over a finite field is algebraic over the polynomial ring if and only if its coefficients can be generated by a finite automaton. Using Christol's result, we prove that the same assertion…
We study correlation estimates of automatic sequences (that is, sequences computable by finite automata) with polynomial phases. As a consequence, we provide a new class of good weights for classical and polynomial ergodic theorems, not…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
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…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…
We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…
Christol and, independently, Denef and Lipshitz showed that an algebraic sequence of $p$-adic integers (or integers) is $p$-automatic when reduced modulo $p^\alpha$. Previously, the best known bound on the minimal automaton size for such a…
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…
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…
In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…
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…
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where…
Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…
In this paper, we construct explicitely polynomial automorphisms of affine n-space for certain n. More precisely, we construct algebraic subgroups of the general polynomial group GA_n(k) where k is an arbitrary base ring of characteristic…
We prove that the property of being closed (resp., palindromic, rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of…