2000 character limit reached
Bowen's formula for a rational graph-directed Markov system
Published 27 Mar 2024 in math.DS | (2403.18612v1)
Abstract: We establish Bowen's formula for the Julia set of a non-elementary, expanding, irreducible and aperiodic rational graph-directed Markov system satisfying the backward separating condition. Towards this end, we shall prove that the associated skew product map is topologically exact on the skew product Julia set, and satisfies the density of repelling periodic points. Moreover, we give a criterion for expandingness in terms of hyperbolicity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.