Search arXivSearch

arXiv · 1810.08792

Separation profiles of graphs of fractals

Abstract

We continue the exploration of the relationship between conformal dimension and the separation profile by computing the separation of families of spheres in hyperbolic graphs whose boundaries are standard Sierpi\'nski carpets and Menger sponges. In all cases, we show that the separation of these spheres is $n^{\frac{d-1}{d}}$ for some $d$ which is strictly smaller than the conformal dimension, in contrast to the case of rank 1 symmetric spaces of dimension $\geq 3$. The value of $d$ obtained naturally corresponds to a previously known lower bound on the conformal dimension of the associated fractal.

Explore related subjects

Keep this discovery

BibTeXRIS

Valeriia Gladkova, Verna Shum. 2018-10-20. Separation profiles of graphs of fractals. https://arxiv.org/abs/1810.08792

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR