Integer partitions and the Sperner property
The objectives of this paper are three-fold. First, we would like to call attention to a very attractive problem, the question of whether or not the poset of integer partitions ordered by refinement has the Sperner property. We provide all necessary definitions, and enough bibliography to interest a newcomer in the problem. Second, we prove four new theorems, two by exhaustive computation and two in the more traditional manner. Finally, we highlight the central role played by Larry Harper in the literature of this subject. (C) 2003 Elsevier B.V. All rights reserved.
integer partition sperner property matching problem