A refined view of a curious identity for partitions into odd parts with designated summands
Abstract
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence of a part. In the same work, they also considered the restricted partitions with designated summands wherein all parts must be odd, and they denoted the corresponding function by PDO(n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.