Euler's partition theorem with upper bounds on multiplicities.
Speaker: Ae Ja Yee, PSU
Abstract: In 1972, George Andrews obtained a theorem on equivalent upper bound sequences of multiplicities, from which the Euler partition theorem on partitions into distinct parts and odd parts can be deduced. In this talk, I will revisit Boulet's four parameter formula for partitions and discuss a unification of Bressenrodt's alternating sum refinement and Andrews' generalization of the Euler theorem.
Room Reservation Information
Room Number: 106 McAllister
Time: 11:15am - 12:05pm