SearcharxivSearch

arXiv · 1506.02636

On CT and CSA Groups and Related Ideas

Abstract

A group is $G$ commutative transitive or CT if commuting is transitive on nontrivial elements. A group $G$ is CSA or conjugately separated abelian if maximal abelian subgroups are malnormal. These concepts have played a prominent role in the studies of fully residually free groups, limit groups and dicriminating groups. They were especially important in the solution to the Tarski problems. CSA always implies CT however the class of CSA groups is a proper subclass of the class of CT groups. For limit groups and finitely generated elementary free groups they are equivalent. In this paper we examine the relationship between the two concepts. In particular we show that a finite CSA group must be abelian. If $G$ is CT then we prove that $G$ is not CSA if and only if $G$ contains a nonabelian subgroup $G_0$ which contains a nontrivial abelian subgroup $H$ that is normal in $G_0$. For $K$ a field the group $PSL(2,K)$ is never CSA but is CT if char$(K) = 2$ and for fields $K$ of characteristic $0$ where $-1$ is not a sum of two squares in $K$. For characteristic $p$, for an odd prime $p$, $PSL(2,K)$ is never CT. Infinite CT groups $G$ with a composition series and having no nontrivial normal abelian subgroup must be monolithic with monolith a simple nonabalian CT group. Further if a group $G$ is monolithic with monolith $N$ isomorphic to $PSL(2,K)$ for a field $K$ of characteristic $2$ and $G$ is CT then $G \cong N$.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Fine, Anthony Gaglione, Gerhard Rosenberger, Dennis Spellman. 2015-06-08. On CT and CSA Groups and Related Ideas. https://arxiv.org/abs/1506.02636

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