The conjugacy problem in the Grigorchuk group is polynomial time decidable

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

In this paper we prove that the conjugacy problem in the Grigorchuk group Γ has polynomial time complexity. This solves a problem posed by Grigorchuk rather unexpectedly.

Original languageEnglish
Pages (from-to)813-833
Number of pages21
JournalGroups, Geometry, and Dynamics
Volume4
Issue number4
DOIs
StatePublished - 2010

Keywords

  • Conjugacy problem
  • Grigorchuk group

Fingerprint

Dive into the research topics of 'The conjugacy problem in the Grigorchuk group is polynomial time decidable'. Together they form a unique fingerprint.

Cite this