Showing math.DSShow all
3 papers · 1 filter
math.DS2026
Rationality and computability of the covering radius for sofic shifts
Tom Meyerovitch, Aidan Young
The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of…
math.DS2025
An ergodic Lebesgue differentiation theorem
Aidan Young
We show that if is a probability measure-preserving dynamical system, and is a countable partition of , then the limit \[ \lim_{n, k \to \infty} \…
math.DS2024
Adversarial ergodic optimization
Aidan Young
In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map $π: (X, T) \to (Y, S)…