Files in this item
Files  Description  Format 

application/pdf 1_Kim_Sun.pdf (942kB)  (no description provided) 
Description
Title:  Bijective proofs of partition identities and covering systems 
Author(s):  Kim, Sun 
Director of Research:  Berndt, Bruce C.; Ford, Kevin 
Doctoral Committee Chair(s):  Berndt, Bruce C. 
Doctoral Committee Member(s):  Ford, Kevin; Hildebrand, A. J.; Duursma, Iwan M. 
Department / Program:  Mathematics 
Discipline:  Mathematics 
Degree Granting Institution:  University of Illinois at UrbanaChampaign 
Degree:  Ph.D. 
Genre:  Dissertation 
Subject(s):  partitions
bijective proofs covering systems 
Abstract:  This dissertation involves two topics. The first is on the theory of partitions, which is discussed in Chapters 2 − 5. The second is on covering systems, which are considered in Chapters 6 − 8. In 2000, Farkas and Kra used their theory of theta functions to establish a beautiful theorem on colored partitions, and they asked for a bijective proof of it. In Chapter 2, we give a bijective proof of a more general partition identity, with the Farkas and Kra partition theorem being a special case. We then derive three further general partition identities and give bijective proofs of these as well. The quintuple product identity is one of the most famous and useful identities in the theory of theta functions and qseries, and dates back to 1916 or earlier. In his recent survey paper on this identity, Shaun Cooper remarked that there does not exist a bijective proof of it. In Chapter 3, employing bijective proofs of Jacobi’s triple product identity and Euler’s pentagonal number theorem, we provide the first bijective proof of the quintuple product identity. In a recent paper, The parity in partition identities, George Andrews investigated parity questions in partition identities and listed 15 open problems at the end of his paper. In Chapter 4, we provide solutions to the first two open problems suggested by Andrews. More precisely, we provide combinatorial proofs of two partition identities which were derived by comparing Andrews’ new identity with G¨ollnitzGordon identities or certain generalizations thereof. In our last chapter on partitions, Chapter 5, we give a combinatorial proof of a companion to Euler’s famous recurrence formula for the sum of divisors function. Euler’s recurrence formula had previously been combinatorially proved using a double counting argument, but its equally famous companion has not heretofore been established combinatorially. We not only provide such a combinatorial proof, but we also give a combinatorial proof of a vast generalization as well. M. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the least modulus N of a covering system is sufficiently large, then the sum of reciprocals of the moduli is bounded below by a function of N, tending to infinity as N goes to infinity, which confirms a conjecture of P. Erd˝os and J. L. Selfridge. They also showed that, forK > 1, the complement in Z of any union of residue classes r(n) (mod n) with distinct n from (N,KN] has density at least dK for N sufficiently large, which implies a conjecture of P. Erd˝os and R. L. Graham. In Chapter 6, we first define covering systems in number fields, and extend those results to arbitrary number fields. In Chapter 7, we give an explicit version of their first theorem to provide a specific number for the least modulus of a covering system, where the reciprocal sum is strictly bigger than 1. In the last chapter, Chapter 8, we consider exact covering systems in number fields. Motivated by the theorem of Davenport, Mirsky, Newman and Rado that there does not exist an exact covering system with distinct moduli, we raise the question whether or not this is true for covering systems in algebraic number fields. We provide affirmative answers for certain quadratic fields. 
Issue Date:  20100514 
URI:  http://hdl.handle.net/2142/15597 
Rights Information:  Copyright 2010 Sun Kim 
Date Available in IDEALS:  20100514 20120515 
Date Deposited:  201005 
This item appears in the following Collection(s)

Graduate Dissertations and Theses at Illinois
Graduate Theses and Dissertations at Illinois 
Dissertations and Theses  Mathematics
Item Statistics
 Total Downloads: 299
 Downloads this Month: 15
 Downloads Today: 0