19 problems
Bounded-region conjecture. The feature vectors of weights of the Whitehead graphs of elements from are separated into bounded regions in the corresponding space. Each such regi…
Nielsen prevalence conjecture.
Constructive membership testing difficulty conjecture. CMT is difficult whenever the group either involves a large abelian group as a quotient of a normal subgroup or has nonab…
Let be the Vershik group of rank , and let be a word with minimal generator length . Its Knuth–Bendix normal form is denoted by . Normal-for…
Let be a free group of rank , let , and let denote the set of automorphic images of having the same length as . Assume that the length of is ir…
Let be the braid group on strands, and measure the input size by the word lengths of the elements involved in the conjugacy problem. Birman–Ko–Lee conjecture. For every f…
Let be the Baumslag-Gersten one-relator group … The conjugacy problem asks whether two words in the generators of represent conjugate elements. Non-polynomial conjugacy alg…
Let denote the -dimensional Heisenberg group. Bodart's conjecture. Rational subset membership is decidable in every Heisenberg group…
Let be the right-angled Artin group for which Bridson constructed a finitely presented subgroup of with undecidable conjugacy and membership problems. A right-angle…
Let be a finitely generated free group, let be a unipotent polynomial suspension, and let denote the automo…
For each integer , let … The subgroup membership conjecture for . The subgroup membership problem is decidable in for every . The subgrou…
Let be a group hyperbolic relative to finitely generated subgroups , and suppose that the generalized conjugacy problem (GCP) in each parabolic subgroup c…
Conjecture that Bridson's group is not coherent. The right-angled Artin group in Bridson's example cannot be coherent.
Let be a group that splits as a finite graph of finitely generated free groups. An algorithm is said to certify that has infinite stature with respect to its vertex groups…
Polynomial-time conjugacy conjecture. The conjugacy problem can be solved in polynomial time for all hyperbolic elements of .
Let be the Baumslag group and call an element of hyperbolic if it is hyperbolic with respect to the relevant HNN-extension structure. The conjugacy problem for hyperbol…
Let be the Baumslag group … The conjugacy problem asks, given two words representing elements of , whether those elements are conjugate. Diekert–Myasnikov–Weiß's conject…
Let be a finite presentation of a non-abelian group , and let denote the words in the generators . For words…
Let be a Garside group with Garside element and canonical length parameter ; let , , and be the quantities defined in the preceding algorithmic complexity…