2025/10/19 by Munagi, Augustine O.
#05A15 (Secondary) #05A17 (Primary) 11P81 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2510.17025
In his classic text, Combinatory Analysis, MacMahon defined a perfect partition of a positive integer n as a partition whose parts contain exactly one partition of every positive integer not exceeding n. In this paper we apply the same definition to overpartitions which are integer partitions with the additional property that the final occurrence of each part may be overlined. It turns out that perfect overpartitions are enumerated by ordered factorization functions in which the occurrence of 2 as a factor determines the presence of an overlined part.