IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Efficient algorithms in Coxeter groups of large type

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/20907

Files in this item

File Description Format
PDF 9624351.pdf (3MB) Restricted to U of Illinois (no description provided) PDF
Title: Efficient algorithms in Coxeter groups of large type
Author(s): Gies, Paul Josef
Doctoral Committee Chair(s): Rotman, Joseph J.
Department / Program: Mathematics
Discipline: Mathematics
Degree Granting Institution: University of Illinois at Urbana-Champaign
Degree: Ph.D.
Genre: Dissertation
Subject(s): Mathematics
Abstract: We 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.
Issue Date: 1995
Type: Text
Language: English
URI: http://hdl.handle.net/2142/20907
Rights Information: Copyright 1995 Gies, Paul Josef
Date Available in IDEALS: 2011-05-07
Identifier in Online Catalog: AAI9624351
OCLC Identifier: (UMI)AAI9624351
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 0
  • Downloads this Month: 0
  • Downloads Today: 0

Browse

My Account

Information

Access Key