Papers
Topics
Authors
Recent
Search
2000 character limit reached

Box dimensions of $(\times m, \times n)$-invariant sets

Published 9 Sep 2020 in math.DS, math.CA, and math.MG | (2009.04208v1)

Abstract: We study the box dimensions of sets invariant under the toral endomorphism $(x, y) \mapsto (m x \text{ mod } 1, \, n y \text{ mod } 1)$ for integers $n>m \geq 2$. The basic examples of such sets are Bedford-McMullen carpets and, more generally, invariant sets are modelled by subshifts on the associated symbolic space. When this subshift is topologically mixing and sofic the situation is well-understood by results of Kenyon and Peres. Moreover, other work of Kenyon and Peres shows that the Hausdorff dimension is generally given by a variational principle. Therefore, our work is focused on the box dimensions in the case where the underlying shift is not topologically mixing and sofic. We establish straightforward upper and lower bounds for the box dimensions in terms of entropy which hold for all subshifts and show that the upper bound is the correct value for coded subshifts whose entropy can be realised by words which can be freely concatenated, which includes many well-known families such as $\beta$-shifts, (generalised) $S$-gap shifts, and transitive sofic shifts. We also provide examples of transitive coded subshifts where the general upper bound fails and the box dimension is actually given by the general lower bound. In the non-transitive sofic setting, we provide a formula for the box dimensions which is often intermediate between the general lower and upper bounds.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.