2000 character limit reached
Adversarial ergodic optimization
Published 27 Aug 2024 in math.DS | (2408.14981v3)
Abstract: In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map $\pi : (X, T) \to (Y, S)$ of topological dynamical systems, and a continuous function $f \in C(X)$, what can be said about the extrema $$\sup_{y \in Y} \inf_{x \in \pi{-1} {y}} \lim_{k \to \infty} \frac{1}{k} \sum_{j = 0}{k - 1} f \left( Tj x \right) ? $$
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.