2000 character limit reached
Specification and towers in shift spaces
Published 3 Feb 2015 in math.DS | (1502.00931v4)
Abstract: 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 equilibrium state, this gives strong statistical properties including the Bernoulli property, exponential decay of correlations, central limit theorem, and analyticity of pressure, which are new even for uniform specification. We give applications to shifts of quasi-finite type, synchronised and coded shifts, and factors of beta-shifts and S-gap shifts.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.