Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-24T23:26:20.269Z Has data issue: false hasContentIssue false
  • English
  • Français

Ergodic optimization for countable alphabet subshifts of finite type

Published online by Cambridge University Press:  01 November 2006

O. JENKINSON ,
R. D. MAULDIN  and
M. URBAŃSKI
O. JENKINSON
Affiliation:
School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK (e-mail: omj@maths.qmul.ac.uk)
R. D. MAULDIN
Affiliation:
Department of Mathematics, University of North Texas, PO Box 311430, Denton, TX 76203-1430, USA (e-mail: mauldin@unt.edu, urbanski@unt.edu)
M. URBAŃSKI
Affiliation:
Department of Mathematics, University of North Texas, PO Box 311430, Denton, TX 76203-1430, USA (e-mail: mauldin@unt.edu, urbanski@unt.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let $X$ be a one-sided subshift of finite type on a countable alphabet, and $T:X\to X$ the shift map. If $f:X\to{\mathbb R}$ is continuous, we provide conditions guaranteeing that $f$-maximizing measures exist, and are characterised by the condition that their support lies in a certain compact set.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 26 , Issue 6 , December 2006 , pp. 1791 - 1803
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)