Back to results

University of Illinois at Urbana-Champaign

The Structure of the Cayley Complex and a Cubic-Time Algorithm for Solving the Conjugacy Problem for Groups of Prime Alternating Knots

Abstract

dc:description

This paper is as self-contained as possible, requiring only some familiarity with groups and with some concepts from first-year topology; some experience with graphs and/or geometric 2-complexes is helpful. The preface includes a history of knot theory and combinatorial group theory.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Johnsgard, Karin Luisa
Contributors dc:contributor
  • Schupp, Paul E.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Identifier
(UMI)AAI9329070
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/72539

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Johnsgard, Karin Luisa. The Structure of the Cayley Complex and a Cubic-Time Algorithm for Solving the Conjugacy Problem for Groups of Prime Alternating Knots. Dissertation thesis, University of Illinois at Urbana-Champaign, 2014. http://hdl.handle.net/2142/72539