We prove that the non-k-equal configuration space of a graph has a discretized model, analogous to the discretized model for configurations on graphs. We apply discrete Morse theory to the latter to give an explicit combinatorial formula for the ranks of homology and cohomology of configurations of two points on a tree. We give explicit presentations for homology and cohomology classes as well as pairings for ordered and unordered configurations of two and three points on a few simple trees, and show that the first homology group of ordered and unordered configurations of two points in any tree is generated by the first homology groups of configurations of two points in three particular graphs, K1,3, K1,4, and the trivalent tree with 6 vertices and 2 vertices of degree 3, via graph embeddings.
|Commitee:||Botvinnik, Boris, Livelybrooks, Dean, Sadofsky, Hal, Vologodski, Vadim|
|School:||University of Oregon|
|Department:||Department of Mathematics|
|School Location:||United States -- Oregon|
|Source:||DAI-B 78/04(E), Dissertation Abstracts International|
|Keywords:||Configuration space, Discrete Morse theory, Graph braid group, Non-k-equal configuration|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be