Back to search

University of British Columbia

Gibbs measures and factor codes in symbolic dynamics

Abstract

dc:description

This dissertation consists principally of four of the author’s research articles, included as Chapters 2 through 5, all within or related to the area of symbolic dynamics, especially to shifts of finite type (SFTs) and sofic shifts. More specifically, each of the articles involves either Gibbs measures or factor codes, with Chapter 3 involving both in an essential way. The research in Chapter 2, in the thermodynamic formalism of dynamical systems, shows that two commonly used definitions of a Gibbs measure coincide for an arbitrary subshift over an arbitrary countable group, and that two different forms of one of these definitions are equivalent under certain regularity hypotheses. The main innovation is a more careful decomposition of holonomies of the Gibbs relation than had previously appeared. Chapter 3 is concerned with the Dobrushin and Lanford-Ruelle theorems, which relate Gibbs and equilibrium measures. This chapter establishes these theorems for irreducible sofic shifts, by lifting to an irreducible SFT and using cyclic structure to reduce to the classical mixing SFT case. The result was already known, by work of Haydn-Ruelle and Baladi, but the proof presented in this chapter is more self-contained. In particular, the argument makes extensive use of the properties of doubly transitive points, and relates them in a novel way to the Gibbs relation studied in Chapter 2. The work in Chapter 4 resolves two new cases of a problem in automata theory that originated in symbolic dynamics. The methods combine the notion of stability, introduced by Culik-Karhumaki-Kari and used by Trahtman in the solution to the road colouring problem, with the framework of graph homomorphisms introduced by Ashley-Marcus-Tuncel. The chapter also includes several new algorithms relevant to the problem. Chapter 5 solves a symbolic dynamics problem related to zero-error coding. The main result, which generalizes Krieger’s embedding theorem, characterizes the subshifts of a given mixing SFT on which a given sliding block code is injective. The proof follows the overall strategy of Krieger’s proof, but with significant technical innovations required to make the embedding compatible with the code.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy - PhD
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • MacDonald, Sophie Querida Tennant
Contributors dc:contributor
  • Marcus, Brian, 1949-
  • Meyerovitch, Tom

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/84237

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

MacDonald, Sophie Querida Tennant. Gibbs measures and factor codes in symbolic dynamics. doctoral thesis, University of British Columbia, 2023. http://hdl.handle.net/2429/84237