2026-09-18T19:31:04Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/844042022-01-13T07:54:04Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Richard Stanley.
Zhang, Yan, Ph. D. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Department of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2014-01-23T18:41:53Z
2014-01-23T18:41:53Z
2013
http://hdl.handle.net/1721.1/84404
867870369
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.
69 pages
eng
Massachusetts Institute of Technology
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
Mathematics.
The combinatorics of adinkras
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4d06c0d1-54fa-4aaa-9f49-673f758aeba6">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>The combinatorics of adinkras</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2013</PublicationDate>
<Authors>
<Author>
<DisplayName>Zhang, Yan, Ph. D. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>