Perfect Overpartitions and Factorization of Integers

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Munagi, Augustine O.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917026935603200
author Munagi, Augustine O.
author_facet Munagi, Augustine O.
contents In his classic text, \emph{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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_17025
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Perfect Overpartitions and Factorization of Integers
Munagi, Augustine O.
Combinatorics
05A17 (Primary) 11P81, 05A15 (Secondary)
In his classic text, \emph{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.
title Perfect Overpartitions and Factorization of Integers
topic Combinatorics
05A17 (Primary) 11P81, 05A15 (Secondary)
url https://arxiv.org/abs/2510.17025