For an affine Weyl group W, we explicitly determine the elements for which the Möbius function of the subposet of affine Grassmannians under the Bruhat order is non-zero by utilizing the quantum Bruhat graph of the classical Weyl group associated to W . Then we examine embedding stable and consistent statistics on the affine Weyl group of type A which permit the definition of an affine infinite symmetric group. / Doctor of Philosophy / Similar to the integers, there are groups that have both an infinite number of elements and also a way to partially order those elements. With a partial ordering, we can consider the interval between two elements. When we make a function that sums over an interval of elements, then we can invert the function by using something called the Mӧbius function. For many groups, the Mӧbius function is extremely unpredictable and calculating the inverse may require us to consider an infinite number of elements. In this paper, we focus on groups called affine Weyl groups, which are very useful in algebraic geometry. It turns out that most elements in these groups have a very predictable pattern in their Mӧbius functions which only considers a finite number of elements. The first part of this paper gives very simple rules for calculating it. The second part of this paper focuses on a special type of affine Weyl group: the affine symmetric groups. We provide an attempt at defining a large parent group, which we call the affine infinite symmetric group, that contains all the other affine symmetric groups.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/89477 |
| Date | 09 May 2019 |
| Creators | Lugo, Michael Ruben |
| Contributors | Mathematics, Shimozono, Mark M., Orr, Daniel D., Mihalcea, Constantin Leonardo, Loehr, Nicholas A. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Dissertation |
| Format | ETD, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0032 seconds