North Dakota State University
Enumeration of Reduced Words of Length N for Coxeter Groups via BrinkHowlett Automaton
Abstract
dc:description.abstractThe overall goal of this paper is to give a method of computing out how many words of length n there are for any Coxeter group via its Brink-Howlett automaton. [6] [7] To build our automaton, we focus on Coxeter systems and root systems honing in on a special set of roots called the small roots. We follow closely [1] [5] for the first two chapters. Finally, we build the Brink-Howlett automaton through literature compiled through the years and present explicit examples of A˜1 and the Coxeter group on three generators which each pair of generators is in a free relation with one another.
Degree
thesis:*- Grantor dc:publisher
- North Dakota State University
- Year dc:date.issued
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Allen, Brandon James
Rights
dc:rights- Statement dc:rights
-
- NDSU policy 190.6.2
- Licence dc:rights.uri
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10365/33026