{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2306"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2306","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Integer Partitions Under Certain Finiteness Conditions","abstract":"This dissertation focuses on problems related to integer partitions under various finiteness restrictions. Much of our work involves the collection of partitions fitting inside a fixed partition $\\lambda$, and the associated generating function $G_{\\lambda}$. In Chapter 2, we discuss the flawlessness of such generating functions, as proved by Pouzet using the Multicolor Theorem. We give novel applications of the Multicolor Theorem to re-prove flawlessness of pure $O$-sequences, and show original flawlessness results for other combinatorial sequences. We also present a linear-algebraic generalization of the Multicolor Theorem that may have far-reaching applications. In Chapter 3, we extend a technique due to Stanton to prove unimodality of $G_\\lambda$ for certain infinite families of partitions $\\lambda$ in 5 and 6 parts. Our most substantial work is presented in Chapter 4, where we initiate the study of the novel poset $\\ds{P_n=\\{G_\\lambda\\,|\\,\\lambda\\vdash n\\}}$. We describe some general structural properties of this poset. Of greatest significance is our result that two ``balancing\" operations on the principal hooks of a partition $\\lambda$ produce generating functions at least as large as $G_{\\lambda}$ (in the ordering of $P_n$), hereby imposing a strong necessary condition on the maxima of $P_n$. We conjecture an asymptotic value of $|P_n|$, and show that determining $|P_n|$ exactly appears to be nontrivial. This we demonstrate by providing an infinite family of non-conjugate pairs of partitions that have the same generating function. Finally, we prove asymptotic results on the number of maxima in this poset.","abstract_html":"This dissertation focuses on problems related to integer partitions under various finiteness restrictions. Much of our work involves the collection of partitions fitting inside a fixed partition $\\lambda$, and the associated generating function <span class=\"etd-inline-math\">G<sub>\\lambda</sub></span>. In Chapter 2, we discuss the flawlessness of such generating functions, as proved by Pouzet using the Multicolor Theorem. We give novel applications of the Multicolor Theorem to re-prove flawlessness of pure $O$-sequences, and show original flawlessness results for other combinatorial sequences. We also present a linear-algebraic generalization of the Multicolor Theorem that may have far-reaching applications. In Chapter 3, we extend a technique due to Stanton to prove unimodality of <span class=\"etd-inline-math\">G<sub>\\</sub>lambda</span> for certain infinite families of partitions $\\lambda$ in 5 and 6 parts. Our most substantial work is presented in Chapter 4, where we initiate the study of the novel poset <span class=\"etd-inline-math\">\\ds{P<sub>n</sub>=\\{G<sub>\\</sub>lambda | \\lambda\\vdash n\\}}</span>. We describe some general structural properties of this poset. Of greatest significance is our result that two ``balancing&quot; operations on the principal hooks of a partition $\\lambda$ produce generating functions at least as large as <span class=\"etd-inline-math\">G<sub>\\lambda</sub></span> (in the ordering of <span class=\"etd-inline-math\">P<sub>n</sub></span>), hereby imposing a strong necessary condition on the maxima of <span class=\"etd-inline-math\">P<sub>n</sub></span>. We conjecture an asymptotic value of <span class=\"etd-inline-math\">|P<sub>n</sub>|</span>, and show that determining <span class=\"etd-inline-math\">|P<sub>n</sub>|</span> exactly appears to be nontrivial. This we demonstrate by providing an infinite family of non-conjugate pairs of partitions that have the same generating function. Finally, we prove asymptotic results on the number of maxima in this poset.","abstract_has_math":true,"creators":["Wagner, Tim"],"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":["Fabrizio Zanello"],"advisors":[],"committee_chairs":[],"committee_members":["William J. Keith","Vladimir D. Tonchev","Bryan J. Freyberg"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:18:18Z","subjects":["Integer partition","Ferrers diagram","Generating function","Young's lattice","Unimodal","Flawless","Discrete Mathematics and Combinatorics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1175"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1175","href":"https://digitalcommons.mtu.edu/etdr/1175","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1175","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1175","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-2306","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Fabrizio Zanello"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["William J. Keith","Vladimir D. Tonchev","Bryan J. Freyberg"]},{"key":"dc:creator","label":"Author","values":["Wagner, Tim"]}]},{"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 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":["Integer partition","Ferrers diagram","Generating function","Young's lattice","Unimodal","Flawless","Discrete Mathematics and Combinatorics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1175","https://digitalcommons.mtu.edu/etdr/1175"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation focuses on problems related to integer partitions under various finiteness restrictions. Much of our work involves the collection of partitions fitting inside a fixed partition $\\lambda$, and the associated generating function $G_{\\lambda}$. In Chapter 2, we discuss the flawlessness of such generating functions, as proved by Pouzet using the Multicolor Theorem. We give novel applications of the Multicolor Theorem to re-prove flawlessness of pure $O$-sequences, and show original flawlessness results for other combinatorial sequences. We also present a linear-algebraic generalization of the Multicolor Theorem that may have far-reaching applications. In Chapter 3, we extend a technique due to Stanton to prove unimodality of $G_\\lambda$ for certain infinite families of partitions $\\lambda$ in 5 and 6 parts. Our most substantial work is presented in Chapter 4, where we initiate the study of the novel poset $\\ds{P_n=\\{G_\\lambda\\,|\\,\\lambda\\vdash n\\}}$. We describe some general structural properties of this poset. Of greatest significance is our result that two ``balancing\" operations on the principal hooks of a partition $\\lambda$ produce generating functions at least as large as $G_{\\lambda}$ (in the ordering of $P_n$), hereby imposing a strong necessary condition on the maxima of $P_n$. We conjecture an asymptotic value of $|P_n|$, and show that determining $|P_n|$ exactly appears to be nontrivial. This we demonstrate by providing an infinite family of non-conjugate pairs of partitions that have the same generating function. Finally, we prove asymptotic results on the number of maxima in this poset."]},{"key":"dc:title","label":"Title","values":["Integer Partitions Under Certain Finiteness Conditions"]}]}],"canonical_facts":{"dc:contributor":["Fabrizio Zanello"],"dc:contributor.committeemember":["William J. Keith","Vladimir D. Tonchev","Bryan J. Freyberg"],"dc:creator":["Wagner, Tim"],"dc:date.created":["2021-01-01T08:00:00Z"],"dc:description.abstract":["This dissertation focuses on problems related to integer partitions under various finiteness restrictions. Much of our work involves the collection of partitions fitting inside a fixed partition $\\lambda$, and the associated generating function $G_{\\lambda}$. In Chapter 2, we discuss the flawlessness of such generating functions, as proved by Pouzet using the Multicolor Theorem. We give novel applications of the Multicolor Theorem to re-prove flawlessness of pure $O$-sequences, and show original flawlessness results for other combinatorial sequences. We also present a linear-algebraic generalization of the Multicolor Theorem that may have far-reaching applications. In Chapter 3, we extend a technique due to Stanton to prove unimodality of $G_\\lambda$ for certain infinite families of partitions $\\lambda$ in 5 and 6 parts. Our most substantial work is presented in Chapter 4, where we initiate the study of the novel poset $\\ds{P_n=\\{G_\\lambda\\,|\\,\\lambda\\vdash n\\}}$. We describe some general structural properties of this poset. Of greatest significance is our result that two ``balancing\" operations on the principal hooks of a partition $\\lambda$ produce generating functions at least as large as $G_{\\lambda}$ (in the ordering of $P_n$), hereby imposing a strong necessary condition on the maxima of $P_n$. We conjecture an asymptotic value of $|P_n|$, and show that determining $|P_n|$ exactly appears to be nontrivial. This we demonstrate by providing an infinite family of non-conjugate pairs of partitions that have the same generating function. Finally, we prove asymptotic results on the number of maxima in this poset."],"dc:identifier":["10.37099/mtu.dc.etdr/1175","https://digitalcommons.mtu.edu/etdr/1175"],"dc:subject":["Integer partition","Ferrers diagram","Generating function","Young's lattice","Unimodal","Flawless","Discrete Mathematics and Combinatorics"],"dc:title":["Integer Partitions Under Certain Finiteness Conditions"],"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:18:18Z"}