Group with solvable conjugacy problem

From Groupprops
Revision as of 13:43, 29 May 2008 by Vipul (talk | contribs) (New page: {{term related to|combinatorial group theory}} {{term related to|geometric group theory}} ==Definition== ===Symbol-free definition=== A '''group with solvable conjugacy problem''' is a...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
This term is related to: combinatorial group theory
View other terms related to combinatorial group theory | View facts related to combinatorial group theory
This term is related to: geometric group theory
View other terms related to geometric group theory | View facts related to geometric group theory

Definition

Symbol-free definition

A group with solvable conjugacy problem is a finitely presented group with a finite presentation having the following property: there is an algorithm that, given any two words in the generators, can, in finite time, test whether the two words represent conjugate elements in the group.

The finite time taken depends on the word, but because the generating set is finite, there are only finitely many words of any length, so we cna obtain an upper bound on the time taken by the algorithm as a function of the length of the word.

Relation with other properties

Stronger properties

Weaker properties