SearcharxivSearch

arXiv · 1809.04008

On the question "Can one hear the shape of a group?" and Hulanicki type theorem for graphs

Abstract

We study the question of whether it is possible to determine a finitely generated group $G$ up to some notion of equivalence from the spectrum $\mathrm{sp}(G)$ of $G$. We show that the answer is "No" in a strong sense. As the first example we present the collection of amenable 4-generated groups $G_\omega$, $\omega\in\{0,1,2\}^\mathbb N$, constructed by the second author in 1984. We show that among them there is a continuum of pairwise non-quasi-isometric groups with $\mathrm{sp}(G_\omega)=[-\tfrac{1}{2},0]\cup[\tfrac{1}{2},1]$. Moreover, for each of these groups $G_\omega$ there is a continuum of covering groups $G$ with the same spectrum. As the second example we construct a continuum of $2$-generated torsion-free step-3 solvable groups with the spectrum $[-1,1]$. In addition, in relation to the above results we prove a version of Hulanicki Theorem about inclusion of spectra for covering graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Artem Dudko, Rostislav Grigorchuk. 2018-09-11. On the question "Can one hear the shape of a group?" and Hulanicki type theorem for graphs. https://arxiv.org/abs/1809.04008

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