English
Related papers

Related papers: Automatic sequences are orthogonal to aperiodic mu…

200 papers

This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a…

Dynamical Systems · Mathematics 2022-10-20 Bernhard Reinke

We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…

Group Theory · Mathematics 2016-07-15 Simon Wacker

We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is pi-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the…

Dynamical Systems · Mathematics 2011-06-28 Matthew Macauley , Jon McCammond , Henning S. Mortveit

We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…

Combinatorics · Mathematics 2015-10-29 Pierre Guillot

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

Formal Languages and Automata Theory · Computer Science 2020-08-24 Daniele D'Angeli , Dominik Francoeur , Emanuele Rodaro , Jan Philipp Wächter

We prove that if $\max\{|a_0|,|a_1|\}\le 10$ and $\lambda\in\ ]-2,2[$, then the sequence defined by $$ 0 \le a_{n+2} +\lambda a_{n+1}+a_n<1 $$ is periodic.

Number Theory · Mathematics 2026-03-17 Shigeki Akiyama , Bill Mance

We consider infinite sequences of superstable orbits (cascades) generated by systematic substitutions of letters in the symbolic dynamics of one-dimensional nonlinear systems in the logistic map universality class. We identify the…

Chaotic Dynamics · Physics 2019-08-07 Leon Zaporski , Felix Flicker

We demonstrate when and how an entire left-infinite orbit of an underlying dynamical system or observations from such left-infinite orbits can be uniquely represented by a pair of elements in a different space, a phenomenon which we call…

Dynamical Systems · Mathematics 2023-04-05 G Manjunath , A de Clercq , MJ Steynberg

We study the periodic behaviour of the dual logarithmic derivative operator $\mathcal{A}[f]=\mathrm{d}\ln f/\mathrm{d}\ln x$ in a complex analytic setting. We show that $\mathcal{A}$ admits genuinely nondegenerate period-$2$ orbits and…

Dynamical Systems · Mathematics 2025-11-27 Xiaohang Yu , William Knottenbelt

In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…

Dynamical Systems · Mathematics 2023-03-15 Gandhar Joshi , Reem Yassawi

We prove automatic continuity theorems for "decomposable" or "local" linear transformations between certain natural subspaces of operator algebras. The transformations involved are not algebra homomorphisms but often are module…

Operator Algebras · Mathematics 2017-06-09 Lawrence G. Brown

The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time…

Formal Languages and Automata Theory · Computer Science 2018-04-19 John Case , Sanjay Jain , Samuel Seah , Frank Stephan

In this paper, we study the Diophantine properties of the orbits of a fixed point in its expansions under continuum many bases. More precisely, let $T_{\beta}$ be the beta-transformation with base $\beta>1$, $\{x_{n}\}_{n\geq 1}$ be a…

Number Theory · Mathematics 2021-03-02 Fan Lv , Baowei Wang , Jun Wu

Let M be a weakly monotone symplectic manifold, and H be a time-dependent Hamiltonian; we assume that the periodic orbits of the corresponding time-dependent Hamiltonian vector field are non-degenerate. We construct a refined version of the…

Symplectic Geometry · Mathematics 2016-07-22 Kaoru Ono , Andrei Pajitnov

S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…

Classical Analysis and ODEs · Mathematics 2020-04-30 Changhao Chen

We provide an explicit family of pairs $(\alpha, \beta) \in \mathbb{R}^k \times \mathbb{R}^k$ such that for sufficiently regular $f$, there is a constant $C>0$ for which the theta sum bound…

Number Theory · Mathematics 2023-07-21 Francesco Cellarosi , Tariq Osman

We show that the presence of a non-contractible one-periodic orbit of a Hamiltonian diffeomorphism of a connected closed symplectic manifold $(M,\omega)$ implies the existence of infinitely many non-contractible simple periodic orbits,…

Symplectic Geometry · Mathematics 2025-04-25 Ryuma Orita

In this paper, we study the dynamics of a non-autonomous dynamical system $(X,\mathbb{F})$ generated by a sequence $(f_n)$ of continuous self maps converging uniformly to $f$. We relate the dynamics of the non-autonomous system…

Dynamical Systems · Mathematics 2017-10-02 Puneet Sharma , Manish Raghav

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

Analysis of PDEs · Mathematics 2016-02-17 Biagio Ricceri

Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton…

Formal Languages and Automata Theory · Computer Science 2016-01-20 Philip Bille , Inge Li Gørtz , Frederik Rye Skjoldjensen