{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2436"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2436","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Major Index over Descent Distributions of Standard Young Tableaux","abstract":"This thesis concerns the generating functions $f_{\\lambda, k}(q)$ for standard Young tableaux of shape $\\lambda$ with precisely $k$ descents, aiming to find closed formulas for a general form given by Kirillov and Reshetikhin in 1988. Throughout, we approach various methods by which further closed forms could be found. In Chapter 2 we give closed formulas for tableaux of any shape and minimal number of descents, which arise as principal specializations of Schur functions. We provide formulas for tableaux with three parts and one more than minimal number of descents, and demonstrate that the technique is extendable to any number of parts. In Chapter 3 we aim to reduce the complexity of Kirillov and Reshetikhin's formula by identifying the summands contributing a nonzero amount to the polynomial. While the resulting formulas are lengthy, they greatly reduce the computation time for specified partition shapes and numbers of descents. In Chapter 4 we investigate an apparent relation among $f_{\\lambda, k}(q)$ and $f_{\\lambda, k-1}(q)$ and discuss how this may lead to a greater insight of the distribution of these statistics. Included appendices give a library of utilities in SageMath and Mathematica to generate the polynomials $f_{\\lambda, k}$ and demonstrate Chapter 4's relationships.","abstract_html":"This thesis concerns the generating functions <span class=\"etd-inline-math\">f<sub>\\lambda, k</sub>(q)</span> for standard Young tableaux of shape $\\lambda$ with precisely $k$ descents, aiming to find closed formulas for a general form given by Kirillov and Reshetikhin in 1988. Throughout, we approach various methods by which further closed forms could be found. In Chapter 2 we give closed formulas for tableaux of any shape and minimal number of descents, which arise as principal specializations of Schur functions. We provide formulas for tableaux with three parts and one more than minimal number of descents, and demonstrate that the technique is extendable to any number of parts. In Chapter 3 we aim to reduce the complexity of Kirillov and Reshetikhin&#x27;s formula by identifying the summands contributing a nonzero amount to the polynomial. While the resulting formulas are lengthy, they greatly reduce the computation time for specified partition shapes and numbers of descents. In Chapter 4 we investigate an apparent relation among <span class=\"etd-inline-math\">f<sub>\\lambda, k</sub>(q)</span> and <span class=\"etd-inline-math\">f<sub>\\lambda, k-1</sub>(q)</span> and discuss how this may lead to a greater insight of the distribution of these statistics. Included appendices give a library of utilities in SageMath and Mathematica to generate the polynomials <span class=\"etd-inline-math\">f<sub>\\lambda, k</sub></span> and demonstrate Chapter 4&#x27;s relationships.","abstract_has_math":true,"creators":["Anible, Emily"],"institution":null,"degree_name":"Master of Science in Mathematical Sciences (MS)","degree_level":"Open Access Master's Thesis","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["William J. Keith"],"advisors":[],"committee_chairs":[],"committee_members":["David Hemmer","Melissa Keranen","Fabrizio Zanello"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:18:27Z","subjects":["Combinatorics","Partition Theory","Standard Young Tableaux","Number Theory","Integer Partitions","Discrete Mathematics and Combinatorics"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1339"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1339","href":"https://digitalcommons.mtu.edu/etdr/1339","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1339","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1339","record_label":"Repository record","record_kind":"doi","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.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-2436","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["William J. Keith"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["David Hemmer","Melissa Keranen","Fabrizio Zanello"]},{"key":"dc:creator","label":"Author","values":["Anible, Emily"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2021-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Master's Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Mathematical Sciences (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Combinatorics","Partition Theory","Standard Young Tableaux","Number Theory","Integer Partitions","Discrete Mathematics and Combinatorics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1339","https://digitalcommons.mtu.edu/etdr/1339"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis concerns the generating functions $f_{\\lambda, k}(q)$ for standard Young tableaux of shape $\\lambda$ with precisely $k$ descents, aiming to find closed formulas for a general form given by Kirillov and Reshetikhin in 1988. Throughout, we approach various methods by which further closed forms could be found. In Chapter 2 we give closed formulas for tableaux of any shape and minimal number of descents, which arise as principal specializations of Schur functions. We provide formulas for tableaux with three parts and one more than minimal number of descents, and demonstrate that the technique is extendable to any number of parts. In Chapter 3 we aim to reduce the complexity of Kirillov and Reshetikhin's formula by identifying the summands contributing a nonzero amount to the polynomial. While the resulting formulas are lengthy, they greatly reduce the computation time for specified partition shapes and numbers of descents. In Chapter 4 we investigate an apparent relation among $f_{\\lambda, k}(q)$ and $f_{\\lambda, k-1}(q)$ and discuss how this may lead to a greater insight of the distribution of these statistics. Included appendices give a library of utilities in SageMath and Mathematica to generate the polynomials $f_{\\lambda, k}$ and demonstrate Chapter 4's relationships."]},{"key":"dc:title","label":"Title","values":["Major Index over Descent Distributions of Standard Young Tableaux"]}]}],"canonical_facts":{"dc:contributor":["William J. Keith"],"dc:contributor.committeemember":["David Hemmer","Melissa Keranen","Fabrizio Zanello"],"dc:creator":["Anible, Emily"],"dc:date.created":["2021-01-01T08:00:00Z"],"dc:description.abstract":["This thesis concerns the generating functions $f_{\\lambda, k}(q)$ for standard Young tableaux of shape $\\lambda$ with precisely $k$ descents, aiming to find closed formulas for a general form given by Kirillov and Reshetikhin in 1988. Throughout, we approach various methods by which further closed forms could be found. In Chapter 2 we give closed formulas for tableaux of any shape and minimal number of descents, which arise as principal specializations of Schur functions. We provide formulas for tableaux with three parts and one more than minimal number of descents, and demonstrate that the technique is extendable to any number of parts. In Chapter 3 we aim to reduce the complexity of Kirillov and Reshetikhin's formula by identifying the summands contributing a nonzero amount to the polynomial. While the resulting formulas are lengthy, they greatly reduce the computation time for specified partition shapes and numbers of descents. In Chapter 4 we investigate an apparent relation among $f_{\\lambda, k}(q)$ and $f_{\\lambda, k-1}(q)$ and discuss how this may lead to a greater insight of the distribution of these statistics. Included appendices give a library of utilities in SageMath and Mathematica to generate the polynomials $f_{\\lambda, k}$ and demonstrate Chapter 4's relationships."],"dc:identifier":["10.37099/mtu.dc.etdr/1339","https://digitalcommons.mtu.edu/etdr/1339"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Combinatorics","Partition Theory","Standard Young Tableaux","Number Theory","Integer Partitions","Discrete Mathematics and Combinatorics"],"dc:title":["Major Index over Descent Distributions of Standard Young Tableaux"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Open Access Master's Thesis"],"thesis:degree_name":["Master of Science in Mathematical Sciences (MS)"]},"updated_at":"2026-11-19T08:18:27Z"}