Related papers: Automatic sequences are orthogonal to aperiodic mu…

Many integer sequences arise as numbers of $G$-orbits on $\binom{X}{n}$ as $n$ varies, for a permutation group $G\subseteq \operatorname{Sym}(X)$. For finite $X$, Stanley proved that these finite sequences increase towards the middle using…

For any primitive proper substitution \sigma, we give explicit constructions of countably many pairwise non-isomorphic substitution dynamical systems {(X_{\zeta_n}, T_{\zeta_n})}_{n=1}^{\infty} such that they all are (strong) orbit…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

Let $-1<\lambda<1$ and $f:[0,1)\to\mathbb{R}$ be a piecewise $\lambda$-affine map, that is, there exist points $0=c_0<c_1<\cdots <c_{n-1}<c_n=1$ and real numbers $b_1,\ldots,b_n$ such that $f(x)=\lambda x+b_i$ for every $x\in…

We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$ for $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ a Sturmian sequence over a binary alphabet and $\beta$ an algebraic number with…

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 study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…

We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…

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…

Let $p(x) \in C(x)$ be a rational function satisfying the condition $p(0)=1$ and $q$ an integer larger than $1$, in this article we will consider the power expansion of the infinite product…

A uniformly bounded complete orthonormal system of functions $\Theta =\{ \theta_n\}_{n=1}^{\infty},$ $ \|\theta_n\|_{L^\infty_{[0,1]} } \leq M $ is constructed such that $\sum_{n=1}^{\infty} a_{n}\theta_{n}$ converges almost everywhere on…

We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.

Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…

We define a uniformly behaved in ${\mathbb N}$ arithmetic sequence ${\bf a}$ and an ${\bf a}$-mean Lyapunov stable dynamical system $f$. We consider the time-average of a continuous function $\phi$ along the ${\bf a}$-orbit of $f$ up to…

Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…

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…

We prove that any $q$-automatic completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ essentially coincides with a Dirichlet character. This answers a question of J. P. Allouche and L. Goldmakher and confirms a conjecture of J.…

One can define the notion of primitive length spectrum for a simple regular periodic graph via counting the orbits of closed reduced primitive cycles under an action of a discrete group of automorphisms. We prove that this primitive length…

Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called the automorphism orbits of $G$, and their number is denoted by $\omega(G)$. Let $\mathbb{F}$ be an infinite field, and let $UT_n(\mathbb{F})$ denote the…

Given an ergodic probability measure preserving dynamical system $\G\acts (X,\mu)$, where $\G$ is a finitely generated countable group, we show that the asymptotic growth of the number of finite models for the dynamics, in the sense of…