Let f be a real-valued function defined on the phase space of a dynamical system. Ergodic optimization is the study of those orbits, or invariant probability measures, whose ergodic f -average is as large as possible.In these notes we establish some basic aspects of the theory: equivalent definitions of the maximum ergodic average, existence and generic uniqueness of maximizing measures, and the fact that every ergodic measure is the unique maximizing measure for some continuous function. Generic properties of the support of maximizing measures are described in the case where the dynamics is hyperbolic. A number of problems are formulated.
We present a new algorithm for efficiently computing the Hausdorff dimension of sets X invariant under conformal expanding dynamical systems. By locating the periodic points of period up to N , we construct approximations s N which converge to dim( X ) super-exponentially fast in N . This method can be used to give rigorous estimates for important examples, including hyperbolic Julia sets and limit sets of Schottky and quasifuchsian groups.
We present a powerful approach to computing the Hausdorff dimension of certain conformally self-similar sets. We illustrate this method for the dimension \mathop{\rm dim}\nolimits_H(E_2) of the set E_2, consisting of those real numbers whose continued fraction expansions contain only the digits 1 or 2. A very striking feature of this method is that the successive approximations converge to \mathop{\rm dim}\nolimits_H(E_2) at a super-exponential rate
Given a non-empty finite subset A of the natural numbers, let EA denote the set of irrationals x∈[0,1] whose continued fraction digits lie in A. In general, EA is a Cantor set whose Hausdorff dimension dim (EA) is between 0 and 1. It is shown that the set [Formula: see text] intersects [0,1/2] densely. We then describe a method for accurately computing dimensions dim (EA), and employ it to investigate numerically the way in which [Formula: see text] intersects [1/2,1]. These computations tend to support the conjecture, first formulated independently by Hensley, and by Mauldin & Urbański, that [Formula: see text] is dense in [0,1]. In the important special case A={1,2}, we use our computational method to give an accurate approximation of dim (E{1,2}), improving on the one given in [18].
Abstract. Ergodic optimization is the study of problems relating to maximizing orbits and invariant measures, and maximum ergodic averages. An orbit of a dynamical system is called f -maximizing if the time average of the real-valued function f along the orbit is larger than along all other orbits, and an invariant probability measure is called fmaximizing if it gives f a larger space average than any other invariant probability measure. In this paper, we consider the main strands of ergodic optimization, beginning with an influential model problem, and the interpretation of ergodic optimization as the zero temperature limit of thermodynamic formalism. We describe typical properties of maximizing measures for various spaces of functions, the key tool of adding a coboundary so as to reveal properties of these measures, as well as certain classes of functions where the maximizing measure is known to be Sturmian.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.