Details

On the Combinatorics of Certain Garside Semigroups On the Combinatorics of Certain Garside Semigroups

by Cornwell, Christopher R

Abstract (Summary)
In his dissertation, F.A. Garside provided a solution to the word and conjugacy problems in the braid group on n-strands, using a particular element that he called the fundamental word. Others have since defined fundamental words in the generalized setting of Artin groups, and even more recently in Garside groups. We consider the problem of finding the number of representations of a power of the fundamental word in these settings. In the process, we find a Pascal-like identity that is satisfied in a certain class of Garside groups.
Bibliographical Information:

Advisor:

School:Brigham Young University

School Location:USA - Utah

Source Type:Master's Thesis

Keywords:mathematics geometric group theory braid groups garside combinatorics

ISBN:

Date of Publication:05/30/2006

© 2009 OpenThesis.org. All Rights Reserved.