Search arXivSearch

arXiv · 2511.07557

On the Regularity of the Dimension of Cookie-Cutter-Like Sets

Abstract

We study the Hausdorff and box-counting dimensions of cookie-cutter-like sets formed by sequential dynamics of a finite number of expanding maps. Under some natural conditions, these dimensions turn out to be the minimum and maximum of the corresponding dimensions of the cookie-cutter sets generated by the individual expanding maps. In the case of one-parameter families of such systems, this provides a simple mechanism for producing non-differentiable fractal dimensions as functions of the parameter. This supports a conjecture that the Hausdorff dimension of the spectrum of a Sturmian Hamiltonian, in general, does not have to be differentiable as a function of the coupling constant. This is in drastic contrast to the analytic dependence of the dimensions of such spectra with quadratic irrational frequencies, e.g. the Fibonacci Hamiltonian, previously shown by M. Pollicott.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Kleptsyn, Alexandro Luna. 2025-11-10. On the Regularity of the Dimension of Cookie-Cutter-Like Sets. https://arxiv.org/abs/2511.07557

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS