The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (Q5654237): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Dehn's algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5788031 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Dehn's algorithm and the conjugacy problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating Knot / rank | |||
Normal rank | |||
Latest revision as of 10:34, 12 June 2024
scientific article; zbMATH DE number 3384299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable |
scientific article; zbMATH DE number 3384299 |
Statements
1972
0 references
The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (English)
0 references
