COMING SOON! PQDT Open is getting a new home!

ProQuest Open Access Dissertations & Theses will remain freely available as part of a new and enhanced search experience at

Questions? Please refer to this FAQ.

Dissertation/Thesis Abstract

Factorization in unitary loop groups and reduced words in affine Weyl groups
by Pittman-Polletta, Benjamin, Ph.D., The University of Arizona, 2010, 175; 3433089
Abstract (Summary)

The purpose of this dissertation is to elaborate, with specific examples and calculations, on a new refinement of triangular factorization for the loop group of a simple, compact Lie group K, first appearing in [34]. This new factorization allows us to write a smooth map from S1 into K (having a triangular factorization) as a triply infinite product of loops, each of which depends on a single complex parameter. These parameters give a set of coordinates on the loop group of K.

The order of the factors in this refinement is determined by an infinite sequence of simple generators in the affine Weyl group associated to K, having certain properties. The major results of this dissertation are examples of such sequences for all the classical Weyl groups.

We also produce a variation of this refinement which allows us to write smooth maps from S1 into SU( n) as products of 2n+1 infinite products. By analogy with the semisimple analog of our factorization, we suggest that this variation of the refinement has simpler combinatorics than that appearing in [34].

Indexing (document details)
Advisor: Pickrell, Doug
Commitee: Flaschka, Hermann, Glickenstein, David, Palmer, John, Pickrell, Doug, Venkataramani, Shankar
School: The University of Arizona
Department: Applied Mathematics
School Location: United States -- Arizona
Source: DAI-B 72/02, Dissertation Abstracts International
Subjects: Mathematics
Keywords: Affine Weyl groups, Birkhoff factorization, Loop groups, Reduced words, Triangular factorization
Publication Number: 3433089
ISBN: 978-1-124-38335-4
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy