Conjugacy Search Problem for Relatively Hyperbolic Groups

2012/11/23 by Zoe Ann O'Connor, Zoe O'Connor, O'Connor, Zoe · 1 citation
Mathematics · #20F10 #Algebraic Geometry and Number Theory #FOS: Mathematics #Geometric Analysis and Curvature Flows #Geometric and Algebraic Topology #Group Theory (math.GR) #math.GR #msc:20F10

paper · pdf · doi:10.48550/arxiv.1211.5561

arxiv created 2012/11/23 · openalex publication_date 2012/11/23 · arxiv updated 2012/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The asymptotic bound for a length-based attack on the Conjugacy Search Problem in relatively hyperbolic groups is cubic for hyperbolic elements and a "small" polynomial for parabolic elements, depending on the Conjugacy Search Problem for the peripheral subgroups. The bound for relatively hyperbolic groups in this paper is a significant improvement on previous work.

Cited by

• Conjugacy in a family of free-by-cyclic groups

Related

• Time complexity of the conjugacy problem in relatively hyperbolic groups
• An Algorithm to Solve the Generalized Conjugacy Problem in Relatively Hyperbolic Groups
• From local to global conjugacy of subgroups of relatively hyperbolic groups
• The conjugacy problem in hyperbolic groups for finite lists of group elements
• Detecting Relatively Quasiconvex Subgroups and Their Induced Peripheral Structure