Ergodic optimization for continuous functions on the Dyck-Motzkin shifts

Abstract

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not intrinsically ergodic. We show that the space of continuous functions on any Dyck-Motzkin shift splits into two subsets: one is a dense Gδ set with empty interior for which any maximizing measure has zero entropy; the other is contained in the closure of the set of functions having uncountably many, fully supported measures that are Bernoulli. One key ingredient of a proof of this result is the path connectedness of the space of ergodic measures of the Dyck-Motzkin shift.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…