| dc.contributor.author | Allen, Brandon James | |
| dc.description.abstract | The 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. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | Enumeration of Reduced Words of Length N for Coxeter Groups via BrinkHowlett Automaton | en_US |
| dc.type | Master's Paper | en_US |
| dc.date.accessioned | 2023-01-17T19:03:33Z | |
| dc.date.available | 2023-01-17T19:03:33Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://hdl.handle.net/10365/33026 | |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Science and Mathematics | en_US |
| ndsu.department | Mathematics | en_US |
| ndsu.advisor | Akhmedov, Azer | |
