arXiv · 2508.11577
The matrix potential game and structures of self-affine sets
Abstract
We present a new variant of the potential game and show that certain compact subsets of $\mathbb{R}^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are non-empty, provide a lower bound for their Hausdorff dimension, show that they have good intersection properties, and provide conditions under which, given $M \in \mathbb{N}$, they contain a homothetic copy of every set with at most $M$ elements. The applications of our game to self-affine sets are new and complement the recent work of Yavicoli et al (Math. Z. 2022 and Int. Math. Res. Not. IMRN 2023) for self-similar sets.
Explore related subjects
Keep this discovery
Richard A. Howat, Andrew Mitchell, Tony Samuel. 2025-08-15. The matrix potential game and structures of self-affine sets. https://arxiv.org/abs/2508.11577
Cite the original work for its findings. Save a collection to share your selection of sources.