Computational complexity and the conjugacy problem
The conjugacy problem for a finitely generated group is the two-variable problem of deciding for an arbitrary pair of elements of , whether or not is conjugate to in . We construct examples of finitely generated, computably presented groups such that for every element of , the problem of deciding if an arbitrary element is conjugate to is decidable in quadratic time but the worst-case complexity of the global conjugacy problem is arbitrary: it can be any c.e. Turing degree , can exactly mirror the Time Hierarchy Theorem, or can be -complete. Our groups also have the property that the conjugacy problem is generically linear time: that is, there is a linear time partial algorithm for the conjugacy problem whose domain has density , so hard instances are very rare. We also consider the complexity relationship of the “half-conjugacy” problem to the conjugacy problem. In the last section we discuss the extreme opposite situation: groups with algorithmically finite conjugation.
2000 Mathematics Subject Classification:Primary 20F36, Secondary 20E36, 57M05
- 1 Introduction
- 2 Non-metic small cancellation theory
- 3 Groups with global conjugacy problem of arbitrary c.e. degree
- 4 The groups for the Time Hierarchy Theorem
- 5 The half-conjugacy problem
- 6 The geometry of conjugacy diagrams
- 7 A group with -complete conjugacy problem
- 8 Groups with algorithmically finite conjugation
The word problem is a special case of the conjugacy problem since an element in a group is equal to the identity if and only if it is conjugate to the identity. The individual conjugacy problem, ICP(), for a fixed element of a group is the problem of deciding whether or not arbitrary elements of are conjugate to . The complexity of an individual conjugacy problem depends on the fixed element , and its complexity may be much less than that of the conjugacy problem in . The word problem for semigroups resembles the conjugacy problem for groups in that it is a two variable problem since an equation cannot generally be reduced to an equation with one fixed side. In 1965, J.C. Shepherdson  constructed finitely presented semigroups in which each individual problem , with fixed and arbitary, is decidable but the global word problem is undecidable of arbitrary c.e. degree. Shortly thereafter Donald Collins  constructed finitely presented groups in which each individual conjugacy problem was decidable but the groups had undeciable conjuacy problem of arbitrary c.e. degree. Indeed, both papers show that if one has a uniformly computable set of c.e. degrees then the complexity of each individual problem problem is bounded by the join of a finite number of the while the global two-variable problem can be of any c.e. degree greater than or equal to any of the .
The constructions of Collins used HNN extensions. Although HNN extensions may generally have complicated conjugacy problems, the time complexity of many individual conjugacy problems may be quite low. Miller  constructed a group which is an HNN extension of a free group of finite rank with finitely generated associated subgroups in which the conjugacy problem is undecidable. However, it was shown in  that the individual conjugacy problem for a generic element is decidable in at most cubic time. See [3, 4] for other examples of HNN extensions and free products with amalgamation where the the complexity of the individual conjugacy problems of many elements is low.
In this article we construct finitely generated, computably presented groups where all individual conjugacy problems are decidable in quadratic time but the global conjugacy problem can have arbitrary worst-case complexity. complexity. (Note in particular that the word problem is decidable in quadratic time.) We discuss this from the viewpoints of the general theory of computability, the Time Hierarchy Theorem and -completeness. There is also now a general awareness that many decision problems are generically easy and this phenomenon for decision problems in group theory was investigated in detail in . Although having arbitrary worst-case complexity, the conjugacy problem in the groups we construct will have linear time generic-case complexity. This means that there is a linear time partial algorithm for the conjugacy problem whose domain has density .
The paper  raised the fascinating question of the “half-conjugacy problem”. Suppose that we have a finitely generated group with an algorithm which decides, given an arbitrary pair of elements of , whether or not is conjugate to one of or : Must have solvable conjugacy problem? One supposes that the answer is “No”, but the question seems very subtle. We do not answer the basic question but we show that for every computable function , there is a group with solvable conjugacy problem in which the half-conjugacy problem is decidable in quadratic time while the conjugacy problem has time complexity greater than . The group also satisfies the above constraints on individual conjugacy problems and generic-case complexity.
Finally, in the last section we discuss the extreme opposite situation where complexity is the worst possible. A finitely generated group with a computably enumerable set of defining relators is algorithmically finite if every infinite computably enumerable subset has two distinct words which define elements equal in . Miasnikov and Osin  showed how to use the Golod-Shafarevich inequality to construct such groups. We say that a finitely generated group has algorithmically finite conjugation if has infinitely many conjugacy classes and every infinite computablely enumerable set of elements of must contain two elements which are conjugate. We show that algorithmically finite groups have algorithmically finite conjugation.
We obtain very precise control over complexity by using non-metric small cancellation theory so we first review the condition which which use. This condition ensures that the structure of conjugacy diagrams in the groups we construct is very simple, thus proving the desired results. We note that our groups require using an infinite number of relators since any group with a finite presentation satisfying our condition has global conjugacy problem decidable in quadratic time. We then review each desired complexity condition and discuss the corresponding groups in separate sections. Howevery, there is really only one basic construction and the different cases require only small adjustments in the defining relators.
We thank the referee for very helpful suggestions.
2. Non-metic small cancellation theory
We construct the desired groups using small cancellation theory. For this we need results developed in Chapter V of Lyndon and Schupp  but we recall some essential definitions and details here.
Let be a finitely generated free group. A subset of is symmetrized if all elements of are cyclically reduced and, for each , all cyclic permutations of both and are also in . We write if is an initial segment of and consists of the remaining letters of , so is reduced without cancellation. If are distinct elements of with and where is nonempty, then is called a piece relative to .
The basic non-metric small cancellation condition is
The sets of defining relators which we construct will satisfy the condition . Even though we will not have a metric condition on the lengths of pieces, we need a good notion of reduction.
Fix a symmetrized subset of the free group . We assume that all generators are pieces. If is any cyclically reduced word, consider the factorization of into maximal pieces. That is, each is a piece and, if is not a suffix of then is not a piece where is the letter following in . The integer is the piece length of with respect to . We denote the piece length of by .
The following lemma is immediate.
Let be a symmetrized subset of . If is a cyclically reduced word and is a cyclic permutation of then and differ by at most .
We need a notion of reduction tailored to the sets of relators which we will use.
A word contains an element of with at most pieces missing if and there is an element with where . A word is weakly cyclically -reduced if w is cyclically reduced in the free group , does not begin and end with powers of the same generator unless is simply a power of a generator, and no cyclic permutation of contains a relator from with at most pieces missing.
The basic result of small cancellation theory is that if where satisfies the condition with then every nontrivial word which is equal to the identity in contains a subword which is an element of with at most pieces missing. (If satisfies the metric condition , so that the length of any piece is less than of the length of any element of in which it occurs, we then have Dehn’s Algorithm.)
3. Groups with global conjugacy problem of arbitrary c.e. degree
A set of positive integers is computably enumerable, written c.e., if there is a Turing machine which enumerates all the elements of . The basic relation between computably enumerable sets is that of Turing reducibility. A set is Turing reducible to a set , denoted , if there is an oracle Turing machine with an oracle for which computes . Two sets and are Turing equivalent if and . Turing equivalence is indeed an equivalence relation and equivalence classes are called Turing degrees. A Turing degree is c.e. if it contains a c.e. set. (Not all sets in a nonzero c.e. degree are themselves c.e. since a set is always Turing equivalent to its complement.) The c.e. Turing degrees are partially ordered by Turing reducibility and it is an important fact that there infinitely many distinct c.e. Turing degrees.
Traditionally, a recursive presentation of a group is a group presentation where the set of generators is finite and the set of defining relators is computably enumerable. A computable presentation of a group is a group presentation where the set of generators is finite and the set of defining relators is computable. We use these terms as distinguishing two different classes of presentations. If a group has a recursive presentation it also has a computable presentation, but this requires changing the presentation.
It was shown in the early 1970’s that the word and conjugacy problems for recursively presented, indeed, finitely presented, groups mirror all possible relations of Turing reducibility between c.e. Turing degrees: The c.e. Turing degrees and satisfy if and only if there is a recursively presented ( finitely presented) group with word problem of Turing degree and conjugacy problem of Turing degree . The result for recursive presentations is in Miller  and the stronger version for finite presentations is due to Collins .
We will show
For every c.e. Turing degree there is computably presented group such that for every fixed element of , the problem of deciding if an arbitrary element is conjugate to is decidable in quadratic time but the conjugacy problem of has degree but linear time generic-case complexity.
Alexander Ol’shanskii and Mark Sapir  proved the deep theorem that any finitely generated group with solvable conjugacy problem can be embedded in a finitely presented group with solvable conjugacy problem, establishing a direct conjugacy analog of the Higman Embedding Theorem. Such a result depends on Ol’shanskii and Sapir’s development of the theory of S-machines. It seems plausible that a very detailed analysis of the definitions and lemmas in their monograph applied to our groups would yield finitely presented groups where the complexity of all the individual conjugacy problems is bounded by a fixed tower of exponentials while the global conjugacy problem is undecidable, but this would need to be carefully verified.
Since we want to discuss computational complexity, we need to be precise about how the lengths of inputs are measured. The standard length function for free groups is essentially a unary notation since it requires reduced words to be completely written out. Thus the length of is . We therefore use a unary notation for positive integers, representing by a repetition of identical symbols. It is a basic fact that if is any infinite c.e. set, there is a computable bijection . Given an infinite c.e. set not containing , fix such an and let be a Turing machine which, on input written in unary, computes in unary. Let be the number of steps used by in computing . Let . The defining relators for the group for will be the symmetrized closure of the the set of relators where
Given the defining relators , it will be immediate from small cancellation theory that
and thus the conjugacy problem in has the same Turing degree as . After discussing the geometry of conjugacy diagrams it will be clear that this is essentially the only difficult case, establishing the desired results.
We first verify that satisfies the piece condition . The conjugating subwords of the relator are the subword
and its inverse. A conjugating part of a relator is of course a piece. Note that for any full power of a generator or or occurring in an , say , that power flanked on both sides by occurrences of the neighboring generators, say , is not a piece. Since the function is one-to-one, and occur only in the relator where . On the other hand, the subword consisting of two successive powers, say , is a piece because the set is infinite and there are with so occurs in the relator . Since the time required to compute and the time required to compute may be the same for different values of and , the three syllables at either end of the conjugating part, say , may occur in different relators.
The relators have been chosen so that the following lemma holds. Indeed, it will hold for the set of relators of all the groups which we construct.
Lemma 3.2 (Reduction Lemma).
There is an algorithm which, given an arbitrary word , calculates a weakly cyclically -reduced conjugate of in quadratic time.
First, in linear time we calculate a cyclically reduced conjugate in the free group which does not begin and end with powers of the same generator, unless it is simply a power of a generator. In the latter case, it weakly cyclically -reduced. The point of the form of the relators is that a relator with at most pieces missing must contain a critical subword of either the form
or the form
or their inverses. This is because there are pieces between the occurrences of critical subwords in the defining relators. On seeing such a subword in , run the Turing machine which calculates for steps on input and see if calculates in exactly that number of steps. If so, we indeed have part of a conjugate of the relator or its inverse. Next, check that the part of containing the above subword has the correct form, that is, generators are in the correct order and have the appropriate powers or . If we expand the occurrence to a subword which is part of a relator and is a product of at most pieces, replace by and freely cyclically reduce the resulting word to obtain . Note that the piece length of is at least less than the piece length of . Repeat until we do not find any critical subwords. The proof for the other sets of relators we construct will be the same. ∎
We review the idea of generic-case complexity from the paper . Let be a nonempty finite alphabet and let . The density of at , written , is the number of words in of length less than or equal to divided by the number of all words of length less than or equal to . If limit we say that is generic in . A particular decision problem on words over is said to generically computable in time if there is a partial algorithm for which answers correctly on an input in time or else does not give an answer and such that the domain of is generic in .
We point out that while worst-case complexity of the word or conjugacy problems is independent of a given presentation for a finitely generated group, this is not the case for generic-case complexity. To show that a decision problem having a certain generic-case complexity is a property of the group one needs to show that for every finitely generated presentation of there is a partial algorithm working in the given time bound. For the groups which we construct, the conjugacy problem is generically linear time by Theorem C of  since our groups have infinite abelianizations containing . From the form of the relators, after abelianization the and generators disappear, so they generate a free abelian subgroup in the abelianization, and the abelianization is independent of presentation.
4. The groups for the Time Hierarchy Theorem
We now want to mirror the Time Hierarchy Theorem. We discuss a few details of the proof following the presentation in Arora and Barak . They consider Turing machines with a special input tape, some number of work tapes and an output tape. Such a machine is completely determined by a complete listing of its transition function, which can easily be encoded by a string of ’s and ’s beginning with , and thus can be regarded as a binary number. Many strings are not valid codes of Turing machines. We then express strings coding Turing machines as unary numbers and is the Turing machine coded by a unary . Of course, there are infinitely many numbers coding machines with exactly the same behavior. (Just add an arbitrary number of non-reachable states.)
If is a fully time constructable function then there is a language with but such that . It is a fact that there is a universal Turing machine which, on input , simulates on input in time . Now consider the Turing machine which, on unary input , halts and outputs if does not code a Turing machine and otherwise uses the universal machine to simulate on input for steps. If halts and outputs then halts and outputs . Otherwise halts and outputs . Let be the set of unary inputs on which halts and outputs . Then DTIME() but DTIME(). If were in DTIME(), there would a Turing machine which obtains the same output as in time . For any constant , there is an such that for all . Since there are infinitely many Turing machines with the same behavior as , let be the code of such a machine with . Then would obtain the same result as on input in time , a contradiction.
We again use the free group . Now let be the time used by in deciding if . We will use almost the same set of relators as before. The defining relators for the group for will be the symmetrized closure of the following set of relators where we now have
The same considerations as before shows that this satisfies the piece condition and that there is a quadratic time algorithm which, given , calculates a weakly cyclically reduced conjugate of . Given the defining relators , it will again be immediate from small cancellation theory that
and that the conjugacy problem for is not in but is in .
For every fully time constructable function with , there is a computably presented group such that for every fixed element of , the problem of deciding if an arbitrary element is conjugate to is decidable in quadratic time while the conjugacy problem of is decidable in time but is not decidable in time . The conjugacy problem of has linear time generic-case complexity.
5. The half-conjugacy problem
Our result on the half-conjugacy problem is the following.
For every computable function there is a computably presented group with solvable conjugacy problem for which the half-conjugacy problem is solvable in quadratic time but the time complexity function of the conjugacy problem satisfies for all . The group retains the property that all individual conjugacy problems are decidable in quadratic time and the conjugacy problem has linear time generic-case complexity.
For the half-conjugacy problem, now let be any computable function . One can construct a Turing machine which, on unary input , halts and outputs if does not code a Turing machine and otherwise uses the universal machine to simulate on input for steps. If halts and outputs then halts and outputs . Otherwise halts and outputs . The machine computes a total function . Let be the time used by in computing . Let be the set of unary inputs on which outputs . Since we have diagonalized over , is computable in time but not in time .
Again let . The set of defining relators will be where for ,
while for ,
The set again satisfies the piece condition . Note that the relators show that for all the element is conjugate to either or to its inverse, but which possibility holds depends on whether or not . Furthermore, any algorithm for the conjugacy problem decides membership in and so takes as much time as .
6. The geometry of conjugacy diagrams
Although various results of small cancellation theory are often stated for a metric small cancellation condition, results about the geometry of the relevant diagrams depend only on the appropriate piece condition. We have seen that given an arbitrary element we can effectively find a weakly cyclically -reduced conjugate of in quadratic time. What we now need is that given two weakly cyclically -reduced words and which are not equal to the identity in and which are conjugate in , the conjugacy diagram for and satisfies the conclusion of Theorem 5.5 of Chapter V of Lyndon-Schupp. (, page 257.)
Fix any group among the groups we have constructed. Let and be two nontrivial weakly cyclically -reduced words which are conjugate in and let be a reduced conjugacy diagram for and with outer boundary and inner boundary . Then every region of has edges on both and , has at most two interior edges and has no interior vertices.
In short, the theorem says that “looks like” one of the diagrams in Figure 1. The essential difference between the two pictures is whether or not the inner and outer boundaries have any vertices in common.
That and are weakly cyclically -reduced means that no cyclic permutation of either contains an element of with at most pieces missing. Since satisfies the condition , this means that any region which intersected only or and such that the intersection is a consecutive part of the boundary would have interior degree at least , which will be impossible by the counting formulas. These formulas depend only on the piece condition and thus the conclusion of Theorem 5.5 follows just as in the metric case.
We give the detailed argument for the groups with conjugacy problem of desired c.e. degree. Given an arbitrary nonidentity element of , fix a weakly cyclically reduced conjugate of . For powers or which occur in , we need to know if or are in and, if so, what arguments of the function give those values. We claim that this finite amount of information suffices to decide conjugacy to and thus conjugacy to .
Given an element , we can calculate a weakly cyclically -reduced conjugate of in quadratic time by the Reduction Lemma, Lemma 3.2. If in the free group , they are conjugate in . If not, but in , there is a minimal conjugacy diagram for and containing at least one region. Let , labelled by , be the outer boundary of , and let , labelled by , be the inner boundary of . The structure theorem shows that, since the piece length of the intersection of the boundary of any region with either the outer or inner boundary of is a most , the intersection of the boundary of with both and must contain several occurrences of generators to the same power . Since we are just considering conjugacy to , the free group length of is a constant in this algorithm.
In a conjugacy diagram for and , say that an edge and an edge are “opposite each other” if one of the following conditions holds:
the two edges are on both boundaries and coincide;
the edges form the beginning of an island in that the edge preceding them is on both boundaries and are successive edges on the boundary of a region of ;
is a successive part of the boundary of a region and is the label on an interior edge separating from another region.
The main point is that if we choose a letter in and a letter in and suppose that they are the labels on edges which are opposite each other in , then is only one way to fill in the rest of the conjugacy diagram and we can calculate whether or not a valid conjugacy diagram with this initial condition exists in linear time. If we succeed in constructing a valid conjugacy diagram for one of the possible initial conditions, then and are conjugate, and if we cannot construct a conjugacy diagram then they are not conjugate.
It is also clear from the structure of conjugacy diagrams that
so a solution to the conjugacy problem for decides membership in . On the other hand, given an oracle for the set we can calculate weakly cyclically -reduced conjugates for any pair of elements and then apply the method above to decide conjugacy and the conjugacy problem for is Turing equivalent to deciding membership in .
For the groups for the Time Hierarchy Theorem it is clear that
so the conjugacy problem cannot be calculated in time .
The conjugating part of the defining relators has been chosen so that the only way that or or or their inverses can be subwords of the label on an interior edge in a reduced diagram is if they are matched against the corresponding generators of the other conjugating part of the same relator. And since the boundary labels of a conjugacy diagram are freely reduced, the entire conjugating parts must then be exactly matched and appear as the label on the interior edge. If all interior edges are so labelled, the diagram shows that a power of some is conjugacy to the same power of .
If it is the case that for some region of the conjugacy diagram a conjugating part of the relator is not completely matched against its inverse, then some occurs on one of the boundaries and the padding allows us to calculate in linear time if this is indeed a correct part of a relator. In this case we can again see if one can construct a valid conjugacy diagram in quadratic time. So the algorithm in time for membership in solves the conjugacy problem for .
The remarks for the groups apply exactly to the groups for the half-conjugacy problem. The only hard case is when a power of is conjugate to the corresponding power of or to its inverse. The relators force one of the two possibilities to hold but deciding which one requires deciding membership in . So the conjugacy problem for these groups is solvable in time but not in time .
7. A group with -complete conjugacy problem
We now want to construct a computably presented group with -complete conjugacy problem while keeping the constraint that all individual conjugacy problems are decidable in quadratic time and that the conjugacy problem for the given presentation is strongly generically quadratic time. The previous results on imitating the Time-Hierarchy Theorem and the half-conjugacy problem depended on using the free group unary notation since this notation gives enough padding in the conjugating parts of the relators to check the correctness of relators. Of course, elements of a free group also have a unique normal form with exponents, where we write powers of generators as the name of the generator with a decimal exponent. A syllable is such a power of a generator and we require that adjacent syllables are powers of distinct generators. For example, one element of the free group is . The length of a normal form with exponents is the total number of symbols in the normal form. Thus for the example just given. Basic decision problems in free groups mainly retain their polynomial-time decidability in this notation. For example, Gurevich and Schupp  show that the uniform membership problem for finitely generated subgroups of a free group remains in polynomial time when elements are written in exponent normal form. We need to use exponent normal form in order to have a coding of the satisfiability problem for Boolean expressions where the coded length is proportional to the length of the standard coding of such expressions.
The problem 3-SAT is the satisfiability problem for Boolean expressions which are conjunctions of clauses, each of which contains exactly three literals. A literal is the symbol with positive decimal subscript, representing a variable, or its negation. For example, the expression
is an instance of -SAT. A basic result of complexity theory is that -SAT is -complete. Variables may be repeated in a clause but we assume that a clause does not both a variable and its negation.
We will represent the clause as with the exponent negative if the variable is negated. We represent a conjunction of clauses by the concatenation of the representatives of the clauses. Thus we represent the example of -SAT given above by
So the length of our basic coding is even shorter than the standard coding of instances of -SAT.
In order to represent -SAT we need to code all its instances. To do this we put a “short-lex” well-ordering on as follows. The index of a triple is , the sum of the absolute values of the . We order triples first by index, and within the same index lexicographically but with positive values preceding negative ones. Note that we consider only triples which do not contain since subscripts of variables are positive.
We define an enumeration of all instances of -SAT as follows. We enumerate all pairs of positive integers in the usual way. When a pair is enumerated, we then enumerate all instances of -SAT where there are at most clauses and the maximum index of any clause is at most and the instance has not previously been enumerated. The clauses in an instance are concatenated in the short-lex order defined above and we order instances lexicograpically.
A language is characterized by the fact that for every instance which is in , there is a short certificate, given which one can verify in polynomial time that the instance is indeed in . For -SAT this certificate is an assignment of truth values showing that the instance is actually satisfiable. For an instance of -SAT which is satisfiable we choose the the first satisfying assignment in the usual truth-table order.
We code this satisfying assignment using generators in the following way. For our running example given above, the first line of the truth-table assigning all variables the value false satisfies the instance. So we code this assignment as
The absolute values of the exponents again represent the variables and the sign of the exponent is negative if the variable is assigned the value false and positive if the variable is assigned the value.
The defining relators we use will be words in exponential normal form in the free group on generators
If is a satisfiable instance in the enumeration defined above, let denote the coding of this instance on the generators for and let denote the coding of this instance on the generators for . Let represent the coding of this instance on the generators for . Finally, let represent the coding of the satisfying truth assignment for this instance on the generators .
The basic defining relators for our group is the set where is
and where ranges over all satisfiable instances in the enumeration . Note that although the Greek letters now represent long words on the given generators, taking them to correspond to the Roman letters of the previous groups shows that the general form of the defining relators is essentially the same as before.
We now need to use small cancellation theory over free products, which is essentially like small cancellation theory over free groups. For technical details we again refer to Lyndon-Schupp, but we review some basic definitions. A free group with a specified free basis can be viewed as the free product of the infinite cyclic groups generated by the specified generators. The free product normal form is given by the normal form with exponents but the free product length of a normal form is just the number of syllables in . We now view as this free product.
If and are free product normal forms with the last syllable of and the first syllable of in the same factor, then there is cancellation in the product if and consolidation in the product if . An element is weakly cyclically reduced if or . A set is symmetrized if every element of is weakly cyclically reduced and if then every weakly cyclically reduced conjugate of and is also in .
An element has semi-reduced form if there is no cancellation in the product . Note that consolidation is allowed. An element is a piece relative to R if contains distinct elements and with semi-reduced forms and . The metric small cancellation condition is now
Condition : If has semi-reduced form where is a piece, then . Also, every element of has length greater than .
The set of defining relators we now use is the symmetrized closure of the set defined above, that is, all weakly cyclically reduced conjugates of elements of and their inverses. Since there can be only one basic relator corresponding to a particular instance of -SAT, it is easy to see that the maximum length of a piece relative to is at most the length of the conjugating part of the relator. Thus our set of relators satisfies .
Given this small cancellation condition the geometry of conjugacy diagrams is the same as in the case of quotients of free groups (not viewed as free products). Thus in the quotient group where is the normal closure of we have
if and only if the instance is satisfiable. It follows exactly as in our previous discussion that powers of variants of the above are the only hard instances. Thus each individual conjugacy problem is decidable in quadratic time and the conjugacy problem as a whole is generically linear time. Thus the conjugacy problem of is -complete and the other requirements are met.
8. Groups with algorithmically finite conjugation
We have shown that one can bound the complexity of all individual conjugacy problems while making the global conjugacy problem arbitrarily complex. In Miller’s famous examples of residually finite, finitely presented groups with undecidable conjugacy problem, there is always some element for which is undecidable (Lemma 4 on page 27 in [Miller]). However,  shows that the individual conjugacy problems in Miller’s group are solvable in polynomial time for for all from an exponentially generic subset of . This leads one to ask about the opposite phenomenon.
Are there recursively presented groups with solvable word problem such that if the individual conjugacy problems are decidable on a computably enumerable subset then is negligible, or indeed exponentially negligible?
Although Theorem 3.1 shows that there is no general effective way to build a uniform decision algorithm for the conjugacy problem from solutions of the individual conjugacy problems, the following general lemma holds.
Let be a recursively presented group. If is a finite set of pairwise nonconjugate elements of then there is a partial algorithm which decides the conjugacy problem on the union of the conjugacy classes of the .
The partial algorithm works as follows. Since is recursively presented, when given elements , we can begin enumerating in parallel all words equal in to conjugates of the . If and are in , they will both eventually be enumerated in this process. If they are enumerated as conjugates of the same they represent conjugate elements of . If they are enumerated as conjugates of distinct and they are not conjugate in . ∎
A recursively presented group with only finitely many conjugacy classes has solvable conjugacy problem.
We say that a recursively presented group has algorithmically finite conjugation if has infinitely many conjugacy classes and every infinite c.e. set of elements of must contain two elements which are conjugate. We note that this condition implies that if is a c.e. set of elements of for which there is a partial algorithm solving the conjugacy problem for elements of then must have elements from only finitely many conjugacy classes and we are in the situation of the above lemma. Given a partial algorithm deciding conjugacy for a set containing infinitely many pairwise non-conjugate elements, we could computably enumerate an infinite set of pairwise non-conjugate elements of as follows. Let be the first element in the enumeration of . Now use and the enumeration until we find an element not conjugate to . Continue this process, finding at the -th stage, an element not conjugate to any of .
Thus the conjugacy problem is as bad as possible in a group with algorithmically finite conjugation.
Recall that a group generated by a finite set is termed algorithmically finite [16, 11] if every infinite computably enumerable subset of has two distinct words which define equal elements in . In other words one can computably enumerate only a finite set of words in which define pair-wise distinct elements of . Infinite, recursively presented, algorithmically finite groups are also called Dehn Monsters and have been shown to exist . Indeed, there are even residually finite Dehn Monsters[11, 12]. We next observe that any Dehn Monster has algorithmically finite conjugacy.
Let be an infinite, recursively presented, algorithmically finite group generated by a finite set . Then:
has infinitely many conjugacy classes;
has algorithmically finite conjugation;
Since has unsolvable word problem it has unsolvable conjugacy problem and hence must have infinitely many conjugacy classes by the above corollary. That has algorithmically finite conjugacy is immediate since any infinite c.e. set must have two distinct words which are equal in and thus certainly conjugate. ∎
In Dehn Monsters one can solve the conjugacy problem only on finite unions of conjugacy classes, but there is still a question about the asymptotic density of single conjugacy classes. There are non-amenable finitely generated groups with finitely many conjugacy classes , so not all conjugacy classes in such groups are negligible. Also, the question of whether or not there are finitely generated, residually finite, non-amenable groups with only finitely many conjugacy classes seems to be open.
-  S. I. Adian and V. G. Durnev, Algorithmic problems for groups and semigroups, Uspekhi Mat. Nauk 55 (2000), no. 2, 3–94; translation in Russian Math. Surveys 55 (2000), no. 2, 207–296.
-  S. Arora and B. Borak, Computational Complexity: A Modern Approach Cambridge University Press, Cambridge U.K., 2009.
-  Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov, The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes, Int. J. of Algebra. and Comp., 17, 2007, 1299-1333.
-  A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, The conjugacy problem in HNN-extensions I: regular elements,black holes and generic complexity, Vestnik OMGU, Special Issue, 2007, 103-110.
-  A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, Algorithmic stratification of the conjugacy problem in Miller’s groups, International Journal of Algebra and Computation 17, (2007), pp. 963-997.
-  , B. Cavallo, J. Delgado, D. Kahrobaei and E. Ventura, Algorithmic recognition of infinite cyclic extensions, preprint.
-  D. J. Collins, Recursively enumerable degrees and the conjugacy problem, Acta Mathematica, 125 , (1969), 115-160.
-  D. J. Collins, Representations of Turing reducibility by word and conjugacy problems in finitely presented groups, Acta Mathematica 128 (1972), 73-90.
-  Y. Gurevich and P. Schupp, The uniform membership problem for the modular group, SIAM Journal on Computing 37 (2007), 425-459.
-  I. Kapovich, A. G. Miasnikov, P. E. Schupp and V. Shpilrain, Generic-case Complexity, Decision Problems in Group Theory and Random Walks. J. Algebra, 264 (2003), 665-694.
-  B. Khoussainov, A. Myasnikov, Finitely presented expansions of groups, semigroups and algebras, Trans. AMS., 366, 3 (2014), 1455-1474.
-  A. Klyachko, A. Mongush, Residually finite algorithmically finite groups, their subgroups and direct products, arXiv:1402.0887 [math.GR], 2014.
-  R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Ergebnisse der Mathematik, band 89, Springer Verlag 1977. Reprinted in the Springer Classics in Mathematics series, 2000.
-  C. F. Miller III, On Group-theoretic Decision Problems and their Classification, Ann. of Math. Studies, 68 (1971). Princeton University Press, Princeton.
-  C. F. Miller III, Decision problems for groups – Survey and reflections, in: Algorithms and Classification in Combinatorial Group Theory, G. Baumslag and C.F. Miller III, editors, (1992), Springer, 1–60.
-  A. Miasnikov, D. Osin, Algorithmically finite groups, Journal of Pure and Applied Algebra, 215, (2011), 2789-2796.
-  A. Ol’shanskii and M. Sapir, The Conjugacy Problem and Higman Embeddings, Memoirs of the Amer. Math. Soc., number 804, (2004).
-  D. Osin, Small cancellation over relatively hyperbolic groups and embedding theorems, Annals of Math, 172, (2010), 1-39.
-  C. Papadimitriou, Computation Complexity, (1994), Addison-Wesley, Reading.
-  J. C. Shepherdson, Machine configuration and word problems of given degree of unsolvability, Zeit. f. math. Logik und Grundlagen der Math., 24, (1965), 149-175.