On Dehn's algorithm and the conjugacy problem

From MaRDI portal
Publication:2529204

DOI10.1007/BF01350654zbMath0164.01901WikidataQ56068240 ScholiaQ56068240MaRDI QIDQ2529204

Paul E. Schupp

Publication date: 1968

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/161738




Related Items (31)

On conjugate elements in a semigroup and semigroup diagramsUnsolvable algorithmic problems for semigroups, groups and ringsGeneralized small cancellation conditions, non-positive curvature and diagrammatic reducibilityArtin groups of extra-large type are biautomaticOn the conjugacy problem for knot groupsOn the geometry of semigroup presentationsOn conjugate powers in eighth-groupsThe Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating KnotThe Conjugacy Problem for the Group of Any Tame Alternating Knot is SolvableOn groups Gnk and Γnk: A study of manifolds, dynamics, and invariantsAdjan's theorem and conjugacy in semigroupsOn conjugacy in Greendlinger eight-groupsSome Undecidable Problems in Group TheoryOn the conjugacy problem in a free product with commuting subgroupsPowers and conjugacy in small cancellation groupsThe conjugacy problem for free products of sixth-groups with cyclic amalgamationElementary Properties of Free GroupsOn mathematical contributions of Paul E. SchuppSur les conditions de petite simplification qui permettent d'utiliser l'algorithme de DehnThe Boone-Higman theorem and the conjugacy problemConjugacy search problem and the Andrews-Curtis conjectureOn the conjugacy problem for certain quotient groups of free productsSmall cancellation theory over free products with amalgamationReal elements in small cancellation groupsAlmost all free products of groups have the same positive theoryGeneral theory of groupsSearch problems in groups and branching processesThe word and conjugacy problems for a class of groups with nonhomogeneous conditions of small cancellationThe conjugacy problem for groups of alternating prime tame links is polynomial-timeModel-theoretic and algorithmic questions in group theoryRips-Segev torsion-free groups without the unique product property



Cites Work


This page was built for publication: On Dehn's algorithm and the conjugacy problem