{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/108575"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/108575","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Combinatorial approaches to problems about integer partitions and q-series","abstract":"In this thesis, we study three types of partition-theoretic objects. The first objects studied are odd Ferrers diagrams, which we use in new combinatorial proofs of two general q-series identities containing false theta function and mock theta function identities as special cases. Additionally, we introduce a Gaussian coefficient analogue for restricted odd Ferrers diagrams. The second set of objects we study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the maximum number of parts of simultaneous s- and t- core partitions for certain values of t. In the final section, we introduce a new class of objects called copartitions, which generalize a special class of partitions where all even parts are smaller than all odd parts. A simple graphical representation immediately follows from our definition. We prove an in finite product generating function for cp(n), the number of copartitions of size n. Special cases of this function include sums of the ordinary partition function p(n), a new combinatorial interpretation of the Rogers-Ramanujan functions, and quotients involving theta functions and eta functions. Furthermore, we explore the parity of cp(n) and consider a weighted count of copartitions.","abstract_html":"In this thesis, we study three types of partition-theoretic objects. The first objects studied are odd Ferrers diagrams, which we use in new combinatorial proofs of two general q-series identities containing false theta function and mock theta function identities as special cases. Additionally, we introduce a Gaussian coefficient analogue for restricted odd Ferrers diagrams. The second set of objects we study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the maximum number of parts of simultaneous s- and t- core partitions for certain values of t. In the final section, we introduce a new class of objects called copartitions, which generalize a special class of partitions where all even parts are smaller than all odd parts. A simple graphical representation immediately follows from our definition. We prove an in finite product generating function for cp(n), the number of copartitions of size n. Special cases of this function include sums of the ordinary partition function p(n), a new combinatorial interpretation of the Rogers-Ramanujan functions, and quotients involving theta functions and eta functions. Furthermore, we explore the parity of cp(n) and consider a weighted count of copartitions.","abstract_has_math":false,"creators":["Burson, Hannah Elizabeth"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Berndt, Bruce C","Reznick, Bruce","Ahlgren, Scott D","Zaharescu, Alexandru"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020-10-07T22:07:15Z","date_published":"2020-10-07T22:07:15Z","updated_at":"2026-07-22T22:24:48Z","subjects":["partitions","q-series","mock theta functions","false theta functions"],"languages":["en"],"rights":["Copyright 2020 Hannah E. Burson"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/108575","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Berndt, Bruce C","Reznick, Bruce","Ahlgren, Scott D","Zaharescu, Alexandru"]},{"key":"dc:creator","label":"Author","values":["Burson, Hannah Elizabeth"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-10-07T22:07:15Z","2022-10-07T22:44:53Z","2020-07-06","2020-08"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["partitions","q-series","mock theta functions","false theta functions"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2020 Hannah E. Burson"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/108575"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, we study three types of partition-theoretic objects. The first objects studied are odd Ferrers diagrams, which we use in new combinatorial proofs of two general q-series identities containing false theta function and mock theta function identities as special cases. Additionally, we introduce a Gaussian coefficient analogue for restricted odd Ferrers diagrams. The second set of objects we study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the maximum number of parts of simultaneous s- and t- core partitions for certain values of t. In the final section, we introduce a new class of objects called copartitions, which generalize a special class of partitions where all even parts are smaller than all odd parts. A simple graphical representation immediately follows from our definition. We prove an in finite product generating function for cp(n), the number of copartitions of size n. Special cases of this function include sums of the ordinary partition function p(n), a new combinatorial interpretation of the Rogers-Ramanujan functions, and quotients involving theta functions and eta functions. Furthermore, we explore the parity of cp(n) and consider a weighted count of copartitions.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2022-08-01","The student, Hannah Burson, accepted the attached license on 2020-07-01 at 15:45.","The student, Hannah Burson, submitted this Dissertation for approval on 2020-07-01 at 15:55.","This Dissertation was approved for publication on 2020-07-06 at 14:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #15486 on 2020-10-02 at 15:31:11","Made available in DSpace on 2020-10-07T22:07:15Z (GMT). No. of bitstreams: 11 BURSON-DISSERTATION-2020.pdf: 497683 bytes, checksum: 6650d598b3dcc0898a8b1bead793aef4 (MD5) 01_introduction.tex: 21553 bytes, checksum: aa3eb2c4d822a9b5a2c897b29bfe35dd (MD5) 03_false_theta.tex: 20949 bytes, checksum: 83fb55e740bb8e57357a5bf826e4dedb (MD5) 04_mock_theta.tex: 23461 bytes, checksum: be6a7a5d5932fb1e7f53710f67d5cb8a (MD5) 05_finite.tex: 35806 bytes, checksum: 14e37c9f0cdbbd3b15d487c2226b2c41 (MD5) 06_copartitions.tex: 49252 bytes, checksum: 48e61099b834645d85ca014841303fa9 (MD5) 07_core_partitions.tex: 19694 bytes, checksum: 8773412e73e0d85ba608f72ec12b7b08 (MD5) BursonThesis.tex: 8017 bytes, checksum: bee773fa57c1407adcf2ecd9f0a7588a (MD5) thesisrefs.bib: 19813 bytes, checksum: 89b3c00113f885a4e075714b629e829f (MD5) LICENSE.txt: 4210 bytes, checksum: 26ad9a0dca393a1860b4f00e5dd64019 (MD5) PROQUEST_LICENSE.txt: 4556 bytes, checksum: bccbca8a7b71dffb25922f6b58207c3d (MD5) Previous issue date: 2020-07-06","Embargo set by: Seth Robbins for item 116201 Lift date: 2022-10-07T22:07:19Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 116201 Lift date: 2022-10-07T22:44:53Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Combinatorial approaches to problems about integer partitions and q-series"]}]}],"canonical_facts":{"dc:contributor":["Berndt, Bruce C","Reznick, Bruce","Ahlgren, Scott D","Zaharescu, Alexandru"],"dc:creator":["Burson, Hannah Elizabeth"],"dc:date":["2020-10-07T22:07:15Z","2022-10-07T22:44:53Z","2020-07-06","2020-08"],"dc:description":["In this thesis, we study three types of partition-theoretic objects. The first objects studied are odd Ferrers diagrams, which we use in new combinatorial proofs of two general q-series identities containing false theta function and mock theta function identities as special cases. Additionally, we introduce a Gaussian coefficient analogue for restricted odd Ferrers diagrams. The second set of objects we study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the maximum number of parts of simultaneous s- and t- core partitions for certain values of t. In the final section, we introduce a new class of objects called copartitions, which generalize a special class of partitions where all even parts are smaller than all odd parts. A simple graphical representation immediately follows from our definition. We prove an in finite product generating function for cp(n), the number of copartitions of size n. Special cases of this function include sums of the ordinary partition function p(n), a new combinatorial interpretation of the Rogers-Ramanujan functions, and quotients involving theta functions and eta functions. Furthermore, we explore the parity of cp(n) and consider a weighted count of copartitions.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2022-08-01","The student, Hannah Burson, accepted the attached license on 2020-07-01 at 15:45.","The student, Hannah Burson, submitted this Dissertation for approval on 2020-07-01 at 15:55.","This Dissertation was approved for publication on 2020-07-06 at 14:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #15486 on 2020-10-02 at 15:31:11","Made available in DSpace on 2020-10-07T22:07:15Z (GMT). No. of bitstreams: 11 BURSON-DISSERTATION-2020.pdf: 497683 bytes, checksum: 6650d598b3dcc0898a8b1bead793aef4 (MD5) 01_introduction.tex: 21553 bytes, checksum: aa3eb2c4d822a9b5a2c897b29bfe35dd (MD5) 03_false_theta.tex: 20949 bytes, checksum: 83fb55e740bb8e57357a5bf826e4dedb (MD5) 04_mock_theta.tex: 23461 bytes, checksum: be6a7a5d5932fb1e7f53710f67d5cb8a (MD5) 05_finite.tex: 35806 bytes, checksum: 14e37c9f0cdbbd3b15d487c2226b2c41 (MD5) 06_copartitions.tex: 49252 bytes, checksum: 48e61099b834645d85ca014841303fa9 (MD5) 07_core_partitions.tex: 19694 bytes, checksum: 8773412e73e0d85ba608f72ec12b7b08 (MD5) BursonThesis.tex: 8017 bytes, checksum: bee773fa57c1407adcf2ecd9f0a7588a (MD5) thesisrefs.bib: 19813 bytes, checksum: 89b3c00113f885a4e075714b629e829f (MD5) LICENSE.txt: 4210 bytes, checksum: 26ad9a0dca393a1860b4f00e5dd64019 (MD5) PROQUEST_LICENSE.txt: 4556 bytes, checksum: bccbca8a7b71dffb25922f6b58207c3d (MD5) Previous issue date: 2020-07-06","Embargo set by: Seth Robbins for item 116201 Lift date: 2022-10-07T22:07:19Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 116201 Lift date: 2022-10-07T22:44:53Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/108575"],"dc:language":["en"],"dc:rights":["Copyright 2020 Hannah E. Burson"],"dc:subject":["partitions","q-series","mock theta functions","false theta functions"],"dc:title":["Combinatorial approaches to problems about integer partitions and q-series"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:48Z"}