Aidan Young

collaborators

4 papers

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

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…

math.DS2025

An ergodic Lebesgue differentiation theorem

Aidan Young

We show that if $(X, I^¼, T)$ is a probability measure-preserving dynamical system, and $P$ is a countable partition of $(X, I^¼)$ , then the limit $$ \lim_{n, k \to \infty}…

cs.IT2025

Non-alternating mean payoff games

Tom Meyerovitch, Aidan Young

We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only a…