SearcharxivSearch

arXiv · 2310.14145

A Contracting Fractal Group, Schreier Graphs and The Spectra

Abstract

This paper explores a previously uncharted automaton group generated by a 5-state automaton $(\Pi, A)$ acts by self-similarity on the regular rooted tree $A^{*}$ over a 2-letter alphabet set $A$. Group $G$ has been subjected to several observations that reveal the self-similar $G$-action possesses several notable characteristics: it is a weak branch, contracting, fractal group, and satisfies the open set condition with an exponential growth rate in activity. The corresponding Schreier graphs $\Gamma$ of the group action on the binary rooted tree, for $n\leq 12$, are presented. Furthermore, we delve into a numerical approximation of the spectrum of the discrete Laplacian operator, which is defined on the limit Schreier graph $\hat{\Gamma}=\lim_{n\rightarrow\infty} \Gamma_{n}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Bozorgmehr Vaziri, Frahad Rahmati. 2023-10-22. A Contracting Fractal Group, Schreier Graphs and The Spectra. https://arxiv.org/abs/2310.14145

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