Related papers: On g-functions for countable state subshifts

We prove a generalization of Krieger's embedding theorem, in the spirit of zero-error information theory. Specifically, given a mixing shift of finite type $X$, a mixing sofic shift $Y$, and a surjective sliding block code $\pi: X \to Y$,…

A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…

We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph isomorphic to G? 2. Given a countable graph H that has a(n…

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…

In this paper we give a short proof that the projection of a Gibbs state for a H\"older continuous potential on a mixing shift of finite type under a 1-block fiber-wise mixing factor map has a H\"older continuous g function. This improves a…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

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…

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

For transitive Markov subshifts over countable alphabets, this note ensures that a dense subclass of locally H\"older continuous potentials admits at most a single periodic probability as a maximizing measure. We resort to concepts…

Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over…

In this note, necessary and sufficient conditions are obtained for unilateral weighted shifts to be near subnormal . As an application of the main results, many answers to the Hilbert space problem 160 are presented at the end of the paper.

For a finitely irreducible countable Markov shift and a potential with summable variations, we provide a condition on the associated pressure function which ensures that Bowen's Gibbs state, the equilibrium state, and the minimizer of the…

Sublinear expectations for uncertain processes have received a lot of attention recently, particularly methods to extend a downward-continuous sublinear expectation on the bounded finitary functions to one on the non-finitary functions. In…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We consider some of the main notions of Gibbs measures on subshifts introduced by different communities, such as dynamical systems, probability, operator algebras, and mathematical physics. For potentials with $d$-summable variation, we…

This work is devoted to the study of processes generated by random substitutions over a finite alphabet. We prove, under mild conditions on the substitution's rule, the existence of a unique process which remains invariant under the…

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…

A necessary and sufficient condition is given for the existence of an embedding of an irreducible subshift of finite type into the Fibonacci-Dyck shift

We provide a quantification of the uniqueness of Gibbs measure for topologically mixing countable Markov shifts with locally H\"older continuous potentials. Corollaries for speed of convergence for approximation by finite subsystems are…