Return to search

On the Combinatorics of Certain Garside Semigroups

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.

Identiferoai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-1456
Date06 July 2006
CreatorsCornwell, Christopher R.
PublisherBYU ScholarsArchive
Source SetsBrigham Young University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceTheses and Dissertations
Rightshttp://lib.byu.edu/about/copyright/

Page generated in 0.0019 seconds