Hyperplane arrangement face algebras and their associated Markov chains.
dc.contributor.author | Bidigare, Thomas Patrick | |
dc.contributor.advisor | Hanlon, Philip | |
dc.date.accessioned | 2016-08-30T17:22:52Z | |
dc.date.available | 2016-08-30T17:22:52Z | |
dc.date.issued | 1997 | |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9721946 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/130201 | |
dc.description.abstract | Let ${\cal A}$ be a hyperplane arrangement and let F and G be two of its faces. We define the product of F and G to be the smallest face whose closure contains F and which is separated from G by the fewest number of hyperplanes. Extending this product to linear combinations of faces gives us the face algebra of the arrangement ${\cal A}$. This thesis first analyzes the structures of these face algebras. We identify the nilradical for the face algebra of a general hyperplane arrangement and determine its nilpotency index. The action of the faces of a hyperplane arrangement on its chambers gives us a faithful representation of its face algebra. We develop an elegant formula for the eigenvalues of these chamber representations. The hyperplanes fixed by the reflections in a finite reflection group form a hyperplane arrangement called a reflection arrangement. There is a natural bijection between faces of a reflection arrangement and the left cosets of the parabolic sub-groups of its finite reflection group. We derive an algebraic formula for the product of two parabolic cosets. The elements of a reflection arrangement face algebra which are fixed by the finite reflection group form a subalgebra which is antiisomorphic to Solomon's descent algebra for the finite reflection group. Combinatorial descriptions for faces, edges and chambers are given for the two families of reflection arrangements corresponding to the symmetric and hyperoctahedral groups and the dimensions of their face algebras are determined. We also develop a formula for the eigenvalues of Solomon's symmetric descent algebra acting by right multiplication on the symmetric group algebra. The chamber representation gives us a class of Markov chains on the chambers of hyperplane arrangements. The natural correspondence we develop between the chambers of the symmetric group reflection arrangement and permutations allows us to study several Markov chains on permutations of objects. Our spectral results are used to determine the eigenvalues for several well-known Markov chains including riffle shuffling and the Tsetlin Library, as well as generate some new results. | |
dc.format.extent | 151 p. | |
dc.language | English | |
dc.language.iso | EN | |
dc.subject | Algebras | |
dc.subject | Arrangement | |
dc.subject | Associated | |
dc.subject | Chains | |
dc.subject | Face | |
dc.subject | Hyperplane | |
dc.subject | Markov | |
dc.title | Hyperplane arrangement face algebras and their associated Markov chains. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Mathematics | |
dc.description.thesisdegreediscipline | Pure Sciences | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/130201/2/9721946.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.