Affiliation: Pennsylvania State University
Email: sellersj@math.psu.edu
Title Of Talk: A Connection Between Binary Partitions and Non-Squashing Partitions
URL: http://www.math.psu.edu/sellersj/papers.htm
Abstract: In a recent note, Mike Hirschhorn and I proved that the number of partitions of n of the form n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k and p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1 is equal to the number of binary partitions of n. In this talk, I will discuss more recent work with N. J. A. Sloane in which these partitions are related to a certain box-stacking problem (and are then known as non-squashing partitions). I will close by discussing work with Oystein Rodseth and Kevin Courtright on arithmetic properties of a certain family of non-squashing partitions which are closely linked to Churchhouse's results on binary partitions from the late 1960's.
Last update made Thu Nov 11 14:47:12 EST 2004.
Please report problems to:
frank@math.ufl.edu