Frank G. Garvan

Learn More
We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank ≤ k and those with k in the Rank-Set of partitions. Also, we extend Dyson's adjoint of a partition to MacMahon's " modular " partitions with(More)
Let p(n) denote the number of unrestricted partitions of n. For i = 0, 2, let p i (n) denote the number of partitions π of n such that O(π)−O(π ′) ≡ i (mod 4). Here O(π) denotes the number of odd parts of the partition π and π ′ is the conjugate of π. R. Stanley [13], [14] derived an infinite product representation for the generating function of p 0 (n) − p(More)
Dedicated to the memory of A.J. (Alf) van der Poorten, my former teacher Abstract. New congruences are found for Andrews' smallest parts partition function spt(n). The generating function for spt(n) is related to the holomorphic part α(24z) of a certain weak Maass form M(z) of weight 3 2. We show that a normalized form of the generating function for spt(n)(More)
  • 1