In this thesis, we provide an algorithm for constructing strongly eutactic lattices from vertex transitive graphs. We show that such construction produces infinitely many strongly eutactic lattices in arbitrarily large dimensions. We demonstrate our algorithm on the example of the famous Petersen graph using Maple computer algebra system. We also discuss some additional examples of strongly eutactic lattices obtained from notable vertex transitive graphs. Further, we study the properties of the lattices generated by product graphs, complement graphs, and line graphs of vertex transitive graphs. This thesis is based on the research paper written by the author jointly with L. Fukshansky, D. Needell and J. Park.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:cmc_theses-3274 |
| Date | 01 January 2019 |
| Creators | Xin, Yuxin |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | CMC Senior Theses |
| Rights | default |
Page generated in 0.0026 seconds