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, K_{1,3}, K_{1,4}, and the trivalent tree with 6 vertices and 2 vertices of degree 3, via graph embeddings.
| Identifer | oai:union.ndltd.org:uoregon.edu/oai:scholarsbank.uoregon.edu:1794/20728 |
| Date | 21 November 2016 |
| Creators | Chettih, Safia |
| Contributors | Sinha, Dev |
| Publisher | University of Oregon |
| Source Sets | University of Oregon |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Rights | Creative Commons BY-NC 4.0-US |
Page generated in 0.0016 seconds