Show simple item record

The homology and Varchenko matrix of a generalized braid arrangement.

dc.contributor.authorKerr, Julie Barbara
dc.contributor.advisorHanlon, Philip J.
dc.date.accessioned2016-08-30T17:28:40Z
dc.date.available2016-08-30T17:28:40Z
dc.date.issued1997
dc.identifier.urihttp://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:9732114
dc.identifier.urihttps://hdl.handle.net/2027.42/130512
dc.description.abstractDefine the hyperplane arrangement $A\sb{n,k}$ to be the set of hyperplanes of the form $x\sb{i}-x\sb{j}=m$ for all $1\le i<j\le n$ and integers ${-}k\le m\le k.$ This arrangement is a generalization of the well known braid arrangement $A\sb{n}.$ In this dissertation we show that both the regions of $A\sb{n,k}$ and the top homology of its intersection lattice can be indexed by certain classes of rooted trees. The Varchenko matrix of a hyperplane arrangement with weighted hyperplanes is a square matrix whose rows and columns are indexed by the regions of the arrangement and whose (i,j) entry is equal to the product of the weights of the hyperplanes separating the $i\sp{th}$ and $j\sp{th}$ regions of the arrangement. We use the indexing of the regions of $A\sb{n,k}$ to calculate the determinant of its Varchenko matrix. We also show that the Smith Normal Form of the additive Varchenko matrix (obtained by adding rather than multiplying weights) depends only on the number of hyperplanes in the arrangement and their weights.
dc.format.extent76 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectArrangement
dc.subjectBraid
dc.subjectGeneralized
dc.subjectHomology
dc.subjectMatrix
dc.subjectVarchenko
dc.titleThe homology and Varchenko matrix of a generalized braid arrangement.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineMathematics
dc.description.thesisdegreedisciplinePure Sciences
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/130512/2/9732114.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

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.