Related papers: $\overline{d}$-continuity for countable state shif…

We show that a shift space on a finite alphabet with a non-uniform specification property can be modeled by a strongly positive recurrent countable-state Markov shift to which every equilibrium state lifts. In addition to uniqueness of the…

Let $f:X\to X$ be a continuous map on a compact metric space with finite topological entropy. Further, we assume that the entropy map $\mu\mapsto h_\mu(f)$ is upper semi-continuous. It is well-known that this implies the continuity of the…

For a rational map $f$ and a H\"older continuous potential $\phi$ satisfying $$ \sup\phi< P(f,\phi)$$ the uniqueness and stochastic properties of the corresponding equilibrium states have been extensively studied. For a given rational map…

This note revisits the problem of finding necessary and sufficient conditions for a subshift to have a continuous g-function. Results obtained by Krieger (IMS Lecture Notes-Monograph Series, 48, 306--316, 2006) on finite alphabet subshifts…

For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M.…

In this article, we study the pressure at infinity of potentials defined over countable Markov shifts. We establish an upper semi-continuity result concerning the limiting behaviour of the pressure of invariant probability measures, where…

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…

We will show that a system is synchronized if and only if it has a cover whose cover map is semi-open. Also, any factor code on an irreducible sofic shift is semi-open and the image of a synchronized system by a semi-open code is…

Consider a H\"older continuous potential $\phi$ defined on the full shift $A^\nn$, where $A$ is a finite alphabet. Let $X\subset A^\nn$ be a specified sofic subshift. It is well-known that there is a unique Gibbs measure $\mu_\phi$ on $X$…

Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we…

Let $L:[0,1]\setminus\{d\}\rightarrow [0,1]$ be a one-dimensional Lorenz like expanding map ($d$ is the point of discontinuity), $\mathcal{P}=\{ (0,d),(d,1) \}$ be a partition of $[0,1]$ and $C^{\alpha}([0,1],\mathcal{P})$ the set of…

In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…

We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how…

We establish the large deviation principle for a topological Markov shift over infinite alphabet which satisfies strong combinatorial assumptions called ``finite irreducibility'' or ``finite primitiveness''. More precisely, we assume the…

We prove that the entropy map for countable Markov shifts of finite entropy is upper semi-continuous at ergodic measures. Note that the phase space is non-compact. Applications to systems that can be coded by these shifts, such as positive…

An infinite sequence $\alpha$ over an alphabet $\Sigma$ is $\mu$-distributed w.r.t. a probability map $\mu$ if, for every finite string $w$, the limiting frequency of $w$ in $\alpha$ exists and equals $\mu(w)$. %We raise the question of how…

We provide a direct proof of Agafonov's theorem which states that finite state selection preserves normality. We also extends this result to the more general setting of shifts of finite type by defining selections which are compatible the…

There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from…

We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…