2025/05/27 by Fu, Shishuo, Sellers, James · 2 citations
#05A15 #05A17 #11P84 #33B10 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2505.21111
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).