Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1004.3588

On the Conjugacy Problem in Groups and its Variants

Michèle Feltz
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis deals with the conjugacy problem in groups and its twisted variants. We analyze recent results by Bogopolski, Martino, Maslakova and Ventura on the twisted conjugacy problem in free groups and its implication for the conjugacy problem in free-by-cyclic groups and some further group extensions. We also consider the doubly-twisted conjugacy problem in free groups. Staecker has developed an algorithm for deciding doubly-twisted conjugacy relations in the case where the involved homomorphisms satisfy a certain remnant inequality. We show how a similar condition affects the equalizer subgroup and raise new questions regarding this subgroup. As an application we discuss the Shpilrain-Ushakov authentication scheme based on the doubly-twisted conjugacy search problem in matrix semigroups over truncated polynomials over finite fields. Part of this thesis is devoted to the implementation and testing of some of the previously mentioned concepts in the GAP programming language.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Michèle Feltz. 2010-04-20. On the Conjugacy Problem in Groups and its Variants. https://arxiv.org/abs/1004.3588

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗