The combinatorics of adinkras
Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/84404 |
| _version_ | 1826197317167874048 |
|---|---|
| author | Zhang, Yan, Ph. D. Massachusetts Institute of Technology |
| author2 | Richard Stanley. |
| author_facet | Richard Stanley. Zhang, Yan, Ph. D. Massachusetts Institute of Technology |
| author_sort | Zhang, Yan, Ph. D. Massachusetts Institute of Technology |
| collection | MIT |
| description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013. |
| first_indexed | 2024-09-23T10:45:52Z |
| format | Thesis |
| id | mit-1721.1/84404 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T10:45:52Z |
| publishDate | 2014 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/844042019-04-11T11:07:41Z The combinatorics of adinkras Zhang, Yan, Ph. D. Massachusetts Institute of Technology Richard Stanley. Massachusetts Institute of Technology. Department of Mathematics. Massachusetts Institute of Technology. Department of Mathematics. Mathematics. Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013. Cataloged from PDF version of thesis. Includes bibliographical references (pages 67-69). Adinkras are graphical tools created to study representations of supersymmetry algebras. Besides having inherent interest for physicists, the study of adinkras has already shown nontrivial connections with coding theory and Clifford algebras. Furthermore, adinkras offer many easy-to-state and accessible mathematical problems of algebraic, combinatorial, and computational nature. In this work, we make a self-contained treatment of the mathematical foundations of adinkras that slightly generalizes the existing literature. Then, we make new connections to other areas including homological algebra, theory of polytopes, Pfaffian orientations, graph coloring, and poset theory. Selected results include the enumeration of odd dashings for all adinkraizable chromotopologies, the notion of Stiefel-Whitney classes for codes and their vanishing conditions, and the enumeration of all Hamming cube adinkras up through dimension 5. by Yan Zhang. Ph.D. 2014-01-23T18:41:53Z 2014-01-23T18:41:53Z 2013 Thesis http://hdl.handle.net/1721.1/84404 867870369 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 69 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Mathematics. Zhang, Yan, Ph. D. Massachusetts Institute of Technology The combinatorics of adinkras |
| title | The combinatorics of adinkras |
| title_full | The combinatorics of adinkras |
| title_fullStr | The combinatorics of adinkras |
| title_full_unstemmed | The combinatorics of adinkras |
| title_short | The combinatorics of adinkras |
| title_sort | combinatorics of adinkras |
| topic | Mathematics. |
| url | http://hdl.handle.net/1721.1/84404 |
| work_keys_str_mv | AT zhangyanphdmassachusettsinstituteoftechnology thecombinatoricsofadinkras AT zhangyanphdmassachusettsinstituteoftechnology combinatoricsofadinkras |