Related papers: Non-Archimedean dynamics of the complex shift
To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…
The notion of a $p$-Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the notions of a Pascal graph and a Toeplitz graph. In this paper we introduce the notion of a $p$-Riordan word, and show how to encode…
The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions, which are defined on (and take values in) the ring of p-adic integers, and which satisfy (at least, locally) Lipschitz condition with…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the…
This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…
In this paper, the main aim is to give some characterizations of the boundedness of the maximal or nonlinear commutator of the $p$-adic fractional maximal operator $ \mathcal{M}_{\alpha}^{p}$ with the symbols belong to the $p$-adic…
This paper studies geometric and spectral properties of $S$-adic shifts and their relation to continued fraction algorithms. These shifts are symbolic dynamical systems obtained by iterating infinitely many substitutions. Pure discrete…
A feasible model is introduced that manifests phenomena intrinsic to iterative complex analytic maps (such as the Mandelbrot set and Julia sets). The system is composed of two coupled alternately excited oscillators (or self-sustained…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
If A=Z/2, then A^Z is a compact abelian group. A `linear cellular automaton' is a shift-commuting endomorphism F of A^Z. If P is a probability measure on A^Z, then F `asymptotically randomizes' P if F^j P converges to the Haar measure as…
We provide an ergodicity criterion for uniformly differentiable modulo $p$ functions on ${\mathbb Z}_p$ in regard to the minimal level of the reduced functions by showing that ergodic conditions are explicitly found in terms of the…
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…
This note points out that for any odd prime $p$, Zagier's weight $3/2$ mock Eisenstein series can be completed to a $p$-adic modular form in a way that bears some resemblance to its completion to a harmonic Maass form.
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…
Let E be a quadratic extension of a totally real number field. We construct Stickelberger elements for Hilbert modular forms of parallel weight 2 in anticyclotomic extensions of E. Extending methods developed by Dasgupta and Spie{\ss} from…
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
The Arnoux-Rauzy-Poincar\'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar\'e algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in…
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…