Legendre Theorems for Subclasses of Overpartitions (joint work with Ae Ja Yee)

Combinatorics/Partitions Seminar

Meeting Details

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

Speaker: George Andrews, PSU

Abstract: Legendre noted that Euler’s pentagonal number theorem implies that the number of partitions of n into an even number of distinct parts almost always equals the number of partitions of n into an odd number of distinct parts (the exceptions occur when n is a pentagonal number). Subsequently other classes of partitions, including overpartitions, have yielded related Legendre theorems. In this paper, we examine four subclasses of overpartitions that have surprising Legendre theorems.

Room Reservation Information

Room Number: 106 McAllister

Date: 10/20/2015

Time: 11:15am - 12:05pm