Class Degree and Relative Maximal Entropy
Mahsa Allahbakhshi, Anthony Quas

TL;DR
This paper introduces the class degree as a generalization of the degree for factor codes between shifts of finite type and sofic shifts, providing bounds on ergodic measures with maximal entropy.
Contribution
It defines the class degree for any factor code on a shift of finite type and establishes an invariant upper bound on ergodic measures with maximal entropy in fibers.
Findings
The class degree matches the degree for finite-to-one codes.
An invariant upper bound on ergodic measures with maximal entropy is established.
A uniform distribution property for ergodic measures of relative maximal entropy is proved.
Abstract
Given a factor code from a one-dimensional shift of finite type onto an irreducible sofic shift , if is finite-to-one there is an invariant called the degree of which is defined the number of preimages of a typical point in . We generalize the notion of the degree to the class degree which is defined for any factor code on a one-dimensional shift of finite type. Given an ergodic measure on , we find an invariant upper bound on the number of ergodic measures on which project to and have maximal entropy among all measures in the fibre . We show that this bound and the class degree of the code agree when is ergodic and fully supported. One of the main ingredients of the proof is a uniform distribution property for ergodic measures of relative maximal entropy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Mathematical Dynamics and Fractals · semigroups and automata theory
