Pith. sign in

REVIEW 1 cited by

Conjugacy Search Problem for Relatively Hyperbolic Groups

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1211.5561 v1 pith:JOICQ5KZ submitted 2012-11-23 math.GR

Zoe O'Connor This is my paper · ORCID
classification math.GR
keywords hyperbolicconjugacygroupsproblemrelativelysearchboundelements
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Conjugacy in a family of free-by-cyclic groups

    math.GR 2025-06 conditional novelty 7.0 of 10

    In the free-by-cyclic groups H_m defined by the polynomial-growth automorphism a_i -> a_i a_{i-1}, the conjugator length function is linear and the conjugacy and conjugacy-search problems have polynomial-time solutions.

Pith tools