Search arXivSearch

arXiv · 1001.5323

Class Degree and Relative Maximal Entropy

Abstract

Given a factor code $π$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, 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 $Y$. 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 $Y$, we find an invariant upper bound on the number of ergodic measures on $X$ which project to $ν$ and have maximal entropy among all measures in the fibre $π^{-1}\{ν\}$. 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahsa Allahbakhshi, Anthony Quas. 2011-04-15. Class Degree and Relative Maximal Entropy. https://arxiv.org/abs/1001.5323

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Equidistribution of saddle periodic points for Hénon-like maps

We prove that under a natural assumption on the dynamical degrees, the saddle periodic points of a Hénon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of the results of Bedford-Lyubich-Smillie, Dujardin, and Dinh-Sibony along with improvements of their techniques. We also investigate some fine properties of Green currents associated with the map.

math.DS

A flux-based approach for analyzing the disguised toric locus of reaction networks

Dynamical systems with polynomial right-hand sides are very important in various applications, e.g., in biochemistry and population dynamics. The mathematical study of these dynamical systems is challenging due to the possibility of multistability, oscillations, and chaotic dynamics. One important tool for this study is the concept of reaction systems, which are dynamical systems generated by reaction networks for some choices of parameter values. Among these, disguised toric systems are remarkably stable: they have a unique attracting fixed point, and cannot give rise to oscillations or chaotic dynamics. The computation of the set of parameter values for which a network gives rise to disguised toric systems (i.e., the disguised toric locus of the network) is an important but difficult task. We introduce new ideas based on network fluxes for studying the disguised toric locus. We prove, under mild assumptions, that the disguised toric locus of any network $G$ is a contractible manifold with boundary, and introduce an associated graph $G^{\max}$ that characterizes its interior. These theoretical tools allow us, for the first time, to compute the full disguised toric locus for many networks of interest.

math.DS

On dissonance and orthogonal projections of self-conformal measures

Let $μ$ be a self-conformal measure on $\mathbb{R}^d$. We establish conditions for $μ$ under which $\dim(μ*ν) = \min\lbrace d,\dimμ+\dimν\rbrace$ holds when $ν$ is any Ahlfors-regular or self-conformal measure on $\mathbb{R}^d$. Our main result states the following sufficient condition: $μ$ is totally non-linear and not supported on a smooth hypersurface. We also establish sufficient (likely non-sharp) algebraic conditions for self-conformal measures which are not totally non-linear. In addition, we show that $\dim μ\circπ^{-1} = \min\{ k, \dim μ\}$ for every ortohogonal projection $π:\mathbb{R}^d\to\mathbb{R}^k$, $0<k<d$, when either $d=2$ and $μ$ is not self-similar and not supported on a line, or $d\geq 3$ and $μ$ is totally non-linear and not supported on a smooth hypersurface.

math.DS