Searcharxiv⌕ Search

arXiv · 0704.0091

Groups with finitely many conjugacy classes and their automorphisms

Abstract

We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate elements. Moreover, we present several results concerning embeddings into such groups. As another application of these techniques, we prove that every countable group $C$ can be realized as a group of outer automorphisms of a group $N$, where $N$ is a finitely generated group having Kazhdan's property (T) and containing exactly two conjugacy classes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ashot Minasyan. 2008-08-18. Groups with finitely many conjugacy classes and their automorphisms. https://arxiv.org/abs/0704.0091

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

KEEP EXPLORING

Related papers

Left and right zero subsemigroups and an elementary approach to the Rees-Sushkevich Theorem

In a semigroup $S$ with idempotent $e$, the set of all elements $a$ of $S$ such that $ae=a$ and $ea=e$ forms the maximum left zero subsemigroup of $S$ containing $e$, and the set of all elements $b$ of $S$ such that $be=e$ and $eb=b$ forms the maximum right zero subsemigroup of $S$ containing $e$. We use these maximal right and left zero subsemigroups along with the maximal subgroups of a semigroup in the determination of maximal right and left subgroups, rectangular band subsemigroups, completely simple subsemigroups, rectangular subgroups, and completely $0$-simple subsemigroups. An elementary approach of the Rees-Sushkevich Theorem follows. Then we define rectangular $0$-bands and rectangular $0$-groups as completely $0$-simple analogues of rectangular bands and rectangular groups.

math.GR↗

Common overlattices in trees and trees with fins

Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees with fins. The construction of our counter-example involves working with a certain generalisation of the universal groups of Burger and Mozes.

math.GR↗