On the Parity of the Number of Parts in Distinct-Part Partitions

Combinatorics/Partitions Seminar

Meeting Details

For more information about this meeting, contact Matthew Katz, James Sellers, George Andrews.

Speaker: James Sellers, PSU

Abstract: We will consider relatively recent work by Knopfmacher and Robbins related to the function s(n) which counts the *number* of parts in distinct-part partitions of n. Interestingly enough, the function s(n) has a strong tendency to be even (although it is not clear, a priori, that this should be so). We will shed light on why this phenomenon occurs and then close by proving a number of Ramanujan-like congruences modulo 2 satisfied by s(n) using elementary means.

Room Reservation Information

Room Number: 106 McAllister

Date: 03/19/2013

Time: 11:15am - 12:05pm