{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-3010"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-3010","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group","abstract":"Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. In Chapter 2, we give a combinatorial formula for the Schaper number when the partition has at most two columns. At the end, we provide a conjecture for the Schaper number for the partition of shaper (3^n). Chapter 3 covers the joint work with my advisor, David Hemmer, and is published in the Ramanujan Journal. There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions whose corresponding binary sequence is a palindrome. We give a generating function that counts these partitions and describe how to efficiently generate all of them. Atypically for partition generating functions, we find an unusual significance to prime degrees. Specifically, we prove there are nontrivial palindrome partitions of n except when n=3 or n+1 is prime. We find an interesting new ``branching diagram\" for partitions, similar to Young's lattice, with an action of the Klein four group corresponding to natural operations on the binary sequences. Symmetric functions show up in several areas of mathematics including enumerative combinatorics and representation theory. Tewodros Amdeberhan conjectures equalities of symmetric group characters sums over a new set called Ev(\\lambda). In Chapter 4, I share my results from investigating an alternating sum of characters for Ev(\\lambda) written in terms of the inner product of Schur functions and power sum symmetric functions. I found an equality between the alternating sum of power-sum symmetric polynomials and a product of monomial symmetric polynomials. As a consequence, a special case of an alternating sum of symmetric group characters over the set Ev(\\lambda) equals 0.","abstract_html":"Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. In Chapter 2, we give a combinatorial formula for the Schaper number when the partition has at most two columns. At the end, we provide a conjecture for the Schaper number for the partition of shaper (3^n). Chapter 3 covers the joint work with my advisor, David Hemmer, and is published in the Ramanujan Journal. There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions whose corresponding binary sequence is a palindrome. We give a generating function that counts these partitions and describe how to efficiently generate all of them. Atypically for partition generating functions, we find an unusual significance to prime degrees. Specifically, we prove there are nontrivial palindrome partitions of n except when n=3 or n+1 is prime. We find an interesting new ``branching diagram&quot; for partitions, similar to Young&#x27;s lattice, with an action of the Klein four group corresponding to natural operations on the binary sequences. Symmetric functions show up in several areas of mathematics including enumerative combinatorics and representation theory. Tewodros Amdeberhan conjectures equalities of symmetric group characters sums over a new set called Ev(\\lambda). In Chapter 4, I share my results from investigating an alternating sum of characters for Ev(\\lambda) written in terms of the inner product of Schur functions and power sum symmetric functions. I found an equality between the alternating sum of power-sum symmetric polynomials and a product of monomial symmetric polynomials. As a consequence, a special case of an alternating sum of symmetric group characters over the set Ev(\\lambda) equals 0.","abstract_has_math":false,"creators":["Westrem, Karlee J."],"institution":null,"degree_name":"Doctor of Philosophy in Mathematical Sciences (PhD)","degree_level":"Open Access Dissertation","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["David Hemmer"],"advisors":[],"committee_chairs":[],"committee_members":["William Keith","Robert Schneider","Ramy El-Ganainy"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:20Z","subjects":["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/1892"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1892","href":"https://digitalcommons.mtu.edu/etdr/1892","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1892","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1892","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-3010","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["David Hemmer"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["William Keith","Robert Schneider","Ramy El-Ganainy"]},{"key":"dc:creator","label":"Author","values":["Westrem, Karlee J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2025-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 Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy in Mathematical Sciences (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["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/1892","https://digitalcommons.mtu.edu/etdr/1892"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. In Chapter 2, we give a combinatorial formula for the Schaper number when the partition has at most two columns. At the end, we provide a conjecture for the Schaper number for the partition of shaper (3^n). Chapter 3 covers the joint work with my advisor, David Hemmer, and is published in the Ramanujan Journal. There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions whose corresponding binary sequence is a palindrome. We give a generating function that counts these partitions and describe how to efficiently generate all of them. Atypically for partition generating functions, we find an unusual significance to prime degrees. Specifically, we prove there are nontrivial palindrome partitions of n except when n=3 or n+1 is prime. We find an interesting new ``branching diagram\" for partitions, similar to Young's lattice, with an action of the Klein four group corresponding to natural operations on the binary sequences. Symmetric functions show up in several areas of mathematics including enumerative combinatorics and representation theory. Tewodros Amdeberhan conjectures equalities of symmetric group characters sums over a new set called Ev(\\lambda). In Chapter 4, I share my results from investigating an alternating sum of characters for Ev(\\lambda) written in terms of the inner product of Schur functions and power sum symmetric functions. I found an equality between the alternating sum of power-sum symmetric polynomials and a product of monomial symmetric polynomials. As a consequence, a special case of an alternating sum of symmetric group characters over the set Ev(\\lambda) equals 0."]},{"key":"dc:title","label":"Title","values":["Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group"]}]}],"canonical_facts":{"dc:contributor":["David Hemmer"],"dc:contributor.committeemember":["William Keith","Robert Schneider","Ramy El-Ganainy"],"dc:creator":["Westrem, Karlee J."],"dc:date.created":["2025-01-01T08:00:00Z"],"dc:description.abstract":["Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. In Chapter 2, we give a combinatorial formula for the Schaper number when the partition has at most two columns. At the end, we provide a conjecture for the Schaper number for the partition of shaper (3^n). Chapter 3 covers the joint work with my advisor, David Hemmer, and is published in the Ramanujan Journal. There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions whose corresponding binary sequence is a palindrome. We give a generating function that counts these partitions and describe how to efficiently generate all of them. Atypically for partition generating functions, we find an unusual significance to prime degrees. Specifically, we prove there are nontrivial palindrome partitions of n except when n=3 or n+1 is prime. We find an interesting new ``branching diagram\" for partitions, similar to Young's lattice, with an action of the Klein four group corresponding to natural operations on the binary sequences. Symmetric functions show up in several areas of mathematics including enumerative combinatorics and representation theory. Tewodros Amdeberhan conjectures equalities of symmetric group characters sums over a new set called Ev(\\lambda). In Chapter 4, I share my results from investigating an alternating sum of characters for Ev(\\lambda) written in terms of the inner product of Schur functions and power sum symmetric functions. I found an equality between the alternating sum of power-sum symmetric polynomials and a product of monomial symmetric polynomials. As a consequence, a special case of an alternating sum of symmetric group characters over the set Ev(\\lambda) equals 0."],"dc:identifier":["10.37099/mtu.dc.etdr/1892","https://digitalcommons.mtu.edu/etdr/1892"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Discrete Mathematics and Combinatorics"],"dc:title":["Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Open Access Dissertation"],"thesis:degree_name":["Doctor of Philosophy in Mathematical Sciences (PhD)"]},"updated_at":"2026-11-19T08:19:20Z"}