Minimal sequences in finite graphs and Unique Equilibrium States for some shifts

Update Item Information
Title Minimal sequences in finite graphs and Unique Equilibrium States for some shifts
Publication Type dissertation
School or College College of Science
Department Mathematics
Author Carapezza, Leonard
Date 2018
Description In the first chapter, minimal sequences and minimality detectors are defined in the context of compact metric spaces. Sequence A001511 is used to show that minimality detection with respect to N is equivalent to minimality detection with respect to Z. It is shown that a compact space Y is a minimality detector for a compact space X if and only if every finite set of points in X is isolated by some continuous map from X to Y . Necessary conditions are given for one finite graph to be a minimality detector for another and it is shown that two finite graphs cannot be mutual minimality detectors unless they are homeomorphic. In the second chapter, we build upon the work of Climenhaga and Thompson to show that a dense set of parameters B,a with B > 2 give rise to Ba shift spaces for which all Holder continuous functions have unique equilibrium states.
Type Text
Publisher University of Utah
Dissertation Name Doctor of Philosophy
Language eng
Rights Management (c) Leonard Carapezza
Format application/pdf
Format Medium application/pdf
ARK ark:/87278/s62w388v
Setname ir_etd
ID 1745931
Reference URL https://collections.lib.utah.edu/ark:/87278/s62w388v
Back to Search Results