SearcharxivSearch

arXiv · 1605.00781

Configuration Equivalence is not Equivalent to Isomorphism

Abstract

Giving a condition for the the amenability of groups, Rosenblatt and Willis, first introduced the concept of configuration. From the beginning of the theory, the question whether the concept of configuration equivalence coincides with the concept of group isomorphism was posed. We negatively answer this open question by introducing two non-isomorphic, solvable and hence amenable groups which are configuration equivalent. Also, we will study some types of subgroups in configuration equivalent groups. In particular, we will prove this conjecture, due to Rosenblatt and Willis, that configuration equivalent groups, both include the free non-Abelian group of same rank or not. Finally, we prove that two-sided equivalent groups have same class numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Ali Rejali, Meisam Soleimani Malekan. 2016-05-03. Configuration Equivalence is not Equivalent to Isomorphism. https://arxiv.org/abs/1605.00781

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