Back to results
University of Illinois at Urbana-Champaign
Efficient algorithms in Coxeter groups of large type
Abstract
dc:descriptionWe establish a quadratic time algorithm for the word problem and a cubic time algorithm for the conjugacy problem for Coxeter groups of large type. We also give conditions on the relators of a large-type Coxeter group that are necessary and sufficient for the group to be hyperbolic, and we give a normal form for large-type Coxeter groups that is a regular bicombing, thus establishing that all such groups are biautomatic.
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
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Gies, Paul Josef
- Contributors dc:contributor
-
- Rotman, Joseph J.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright 1995 Gies, Paul Josef
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
AAI9624351
(UMI)AAI9624351 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/20907