In 1956, Alder conjectured an integer partition inequality which generalized Euler’s partition identity, the first Rogers-Ramanujan identity, and a partition identity of Schur. Alder’s conjecture, proved in part by Andrews in 1971, followed by Yee in 2008, and finally completed by Alfes, Jameson, and Lemke Oliver in 2010 states that...
Following the work of Asai, Kaneko, and Ninomiya for Faber polynomials associated to the modular group, and Bannai, Kojima, and Miezaki's partial proof for the case of the Fricke group of level 2, we show that the zeros of certain modular functions for some low-level genus zero groups associated to...
In this dissertation, we consider two problems in number theory, both relating to modular forms. First we consider when a given modular form can be expressed as a quotient in Dedekind's $\eta$ function. Rouse and Webb \cite{RW} have determined the integers $N \leq 500$ such that the graded ring of...
In 2013, Lemke Oliver created a list of all eta-quotients which are theta functions. Then in 2016, Folsom, Garthwaite, Kang, Swisher, and Treneer utilized this list of ``eta-theta'' functions along with Zwegers's construction of mock theta functions to create a set of mock modular forms which are also quantum modular...
In this dissertation, we begin by presenting the result of F. K. C. Rankin and Swinnerton-Dyer on the location of the zeros of the Eisenstein series for the full modular group in the standard fundamental domain. Their simple but beautiful argument shows that all zeros are located on the lower...
We generalize overpartition rank and crank generating functions to obtain k-fold variants, and give a combinatorial interpretation for each. The k-fold crank generating function is interpreted by extending the first and second residual cranks to a natural infinite family. The k-fold rank generating functions generate two families of buffered Frobenius...
In this note, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our extended technique could be a useful tool to prove congruences for certain types of combinatorial...