{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/84404"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/84404","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"The combinatorics of adinkras","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_html":"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_has_math":false,"creators":["Zhang, Yan, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Mathematics.","school":null,"contributors":[],"advisors":["Richard Stanley."],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-07-22T22:21:17Z","subjects":["Mathematics."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/84404","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Richard Stanley."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Mathematics."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Mathematics."]},{"key":"dc:creator","label":"Author","values":["Zhang, Yan, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-01-23T18:41:53Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-01-23T18:41:53Z"]},{"key":"dc:date.issued","label":"Date","values":["2013"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/84404"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 67-69)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["The combinatorics of adinkras"]}]}],"canonical_facts":{"dc:contributor.advisor":["Richard Stanley."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Mathematics."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Mathematics."],"dc:creator":["Zhang, Yan, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2014-01-23T18:41:53Z"],"dc:date.available":["2014-01-23T18:41:53Z"],"dc:date.issued":["2013"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 67-69)."],"dc:description.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."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/84404"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mathematics."],"dc:title":["The combinatorics of adinkras"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:17Z"}