Double Affine Bruhat Order

Given a finite Weyl group W_fin with root system Phi_fin, one can create the affine Weyl group W_aff by taking the semidirect product of the translation group associated to the coroot lattice for Phi_fin, with W_fin. The double affine Weyl semigroup W can be created by using a similar semidirect pro...

Full description

Bibliographic Details
Main Author: Welch, Amanda Renee
Other Authors: Mathematics
Format: Others
Published: Virginia Tech 2019
Subjects:
Online Access:http://hdl.handle.net/10919/89366
id ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-89366
record_format oai_dc
spelling ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-893662020-09-29T05:36:38Z Double Affine Bruhat Order Welch, Amanda Renee Mathematics Orr, Daniel D. Mihalcea, Constantin Leonardo Shimozono, Mark M. Loehr, Nicholas A. Weyl group double affine Bruhat order coverings cocoverings Given a finite Weyl group W_fin with root system Phi_fin, one can create the affine Weyl group W_aff by taking the semidirect product of the translation group associated to the coroot lattice for Phi_fin, with W_fin. The double affine Weyl semigroup W can be created by using a similar semidirect product where one replaces W_fin with W_aff and the coroot lattice with the Tits cone of W_aff. We classify cocovers and covers of a given element of W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized in the affine case using the quantum Bruhat graph of W_fin, and another, which takes a more geometrical approach by using the length difference set defined by Muthiah and Orr. Doctor of Philosophy The Bruhat order is a way of organizing elements of the double affine Weyl semigroup so that we have a better understanding of how the elements interact. In this dissertation, we study the Bruhat order, specifically looking for when two elements are separated by exactly one step in the order. We classify these elements and show that there are only finitely many of them. 2019-05-04T08:00:34Z 2019-05-04T08:00:34Z 2019-05-03 Dissertation vt_gsexam:19309 http://hdl.handle.net/10919/89366 In Copyright http://rightsstatements.org/vocab/InC/1.0/ ETD application/pdf Virginia Tech
collection NDLTD
format Others
sources NDLTD
topic Weyl group
double affine
Bruhat order
coverings
cocoverings
spellingShingle Weyl group
double affine
Bruhat order
coverings
cocoverings
Welch, Amanda Renee
Double Affine Bruhat Order
description Given a finite Weyl group W_fin with root system Phi_fin, one can create the affine Weyl group W_aff by taking the semidirect product of the translation group associated to the coroot lattice for Phi_fin, with W_fin. The double affine Weyl semigroup W can be created by using a similar semidirect product where one replaces W_fin with W_aff and the coroot lattice with the Tits cone of W_aff. We classify cocovers and covers of a given element of W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized in the affine case using the quantum Bruhat graph of W_fin, and another, which takes a more geometrical approach by using the length difference set defined by Muthiah and Orr. === Doctor of Philosophy === The Bruhat order is a way of organizing elements of the double affine Weyl semigroup so that we have a better understanding of how the elements interact. In this dissertation, we study the Bruhat order, specifically looking for when two elements are separated by exactly one step in the order. We classify these elements and show that there are only finitely many of them.
author2 Mathematics
author_facet Mathematics
Welch, Amanda Renee
author Welch, Amanda Renee
author_sort Welch, Amanda Renee
title Double Affine Bruhat Order
title_short Double Affine Bruhat Order
title_full Double Affine Bruhat Order
title_fullStr Double Affine Bruhat Order
title_full_unstemmed Double Affine Bruhat Order
title_sort double affine bruhat order
publisher Virginia Tech
publishDate 2019
url http://hdl.handle.net/10919/89366
work_keys_str_mv AT welchamandarenee doubleaffinebruhatorder
_version_ 1719344375767498752