{"id":{"repo_id":"calpoly","oai_identifier":"oai:digitalcommons.calpoly.edu:theses-4939"},"canonical_url":"https://search.ndltd.org/etd/calpoly/oai:digitalcommons.calpoly.edu:theses-4939","repository":{"repo_id":"calpoly","name":"Cal Poly","base_url":"https://digitalcommons.calpoly.edu/do/oai/"},"display":{"title":"Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms","abstract":"Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition.","abstract_html":"Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition.","abstract_has_math":false,"creators":["Ford, Daniel"],"institution":null,"degree_name":"MS in Mathematics","degree_level":null,"degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Jeffrey Liese","Mathematics","College of Science and Mathematics"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:12:51Z","subjects":["Graph automorphisms","spectral graph theory","equitable partitions","equitable decompositions","eigenvalue multiplicity","shift sequence","Discrete Mathematics and Combinatorics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.calpoly.edu/theses/3277","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.calpoly.edu/theses/3277","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.calpoly.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.calpoly.edu%3Atheses-4939","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jeffrey Liese","Mathematics","College of Science and Mathematics"]},{"key":"dc:creator","label":"Author","values":["Ford, Daniel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-06-03T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-06-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph automorphisms","spectral graph theory","equitable partitions","equitable decompositions","eigenvalue multiplicity","shift sequence","Discrete Mathematics and Combinatorics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.calpoly.edu/theses/3277"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition."]},{"key":"dc:title","label":"Title","values":["Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms"]}]}],"canonical_facts":{"dc:contributor":["Jeffrey Liese","Mathematics","College of Science and Mathematics"],"dc:creator":["Ford, Daniel"],"dc:date.available":["2026-06-03T07:00:00Z"],"dc:date.created":["2026-06-01T07:00:00Z"],"dc:description.abstract":["Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition."],"dc:identifier":["https://digitalcommons.calpoly.edu/theses/3277"],"dc:subject":["Graph automorphisms","spectral graph theory","equitable partitions","equitable decompositions","eigenvalue multiplicity","shift sequence","Discrete Mathematics and Combinatorics"],"dc:title":["Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_name":["MS in Mathematics"]},"updated_at":"2026-11-19T07:12:51Z"}