Search arXivSearch

arXiv · 1201.5452

Flatness is a Criterion for Selection of Maximizing Measures

Abstract

For a full shift with Np+1 symbols and for a non-positive potential, locally proportional to the distance to one of N disjoint full shifts with p symbols, we prove that the equilibrium state converges as the temperature goes to 0. The main result is that the limit is a convex combination of the two ergodic measures with maximal entropy among maximizing measures and whose supports are the two shifts where the potential is the flattest. In particular, this is a hint to solve the open problem of selection, and this indicates that flatness is probably a/the criterion for selection as it was conjectured by A.O. Lopes. As a by product we get convergence of the eigenfunction at the log-scale to a unique calibrated subaction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Renaud Leplaideur. 2012-01-26. Flatness is a Criterion for Selection of Maximizing Measures. https://doi.org/10.1007/s10955-012-0497-7

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS