Related papers: Two-sided shift spaces over infinite alphabets

In this paper, the Beatty multiple shift is introduced, which is a generalization of the multiplicative shift of finite type (multiple SFT) [Kenyon, Peres and Solomyak, Ergodic Theory and Dynamical Systems, 2012] and the affine multiple…

The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…

As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…

We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…

We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate…

We introduce and study a unital version of shift equivalence for finite square matrices over the nonnegative integers. In contrast to the classical case, we show that unital shift equivalence does not coincide with one-sided eventual…

We obtain an operator algebraic characterization for when we can continuously extend the shift map from a standard countable Markov shift $\Sigma_A$ to its respective generalized countable Markov shift $X_A$ (a compactification of…

This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…

By a famous result, functions in backward shift invariant subspaces in Hardy spaces are characterized by the fact that they admit a pseudocontinuation a.e. on $\T$. More can be said if the spectrum of the associated inner function has holes…

Motivated by importance of operator spaces contained in the set of all scalar multiples of isometries ($MI$-spaces) in a separable Hilbert space for $C^*$-algebras and E-semigroups we exhibit more properties of such spaces. For example, if…

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…

Recently a generalization of shifts of finite type to the infinite alphabet case was proposed, in connection with the theory of ultragraph C*-algebras. In this work we characterize the class of continuous shift commuting maps between these…

A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…

We study a compactification of the space of invariant probability measures for a transitive countable Markov shift. We prove that it is affine homeomorphic to the Poulsen simplex. Furthermore, we establish that, depending on a combinatorial…

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…

In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…

For each $\Pi^0_1$ $S\subseteq \mathbb{N}$, let the $S$-square shift be the two-dimensional subshift on the alphabet $\{0,1\}$ whose elements consist of squares of 1s of various sizes on a background of 0s, where the side length of each…