Three Simple Reduction Formulas for the Denumerant Functions

TL;DR

This paper extends existing reduction formulas for the restricted partition function to more general sets using Bernoulli-Barnes polynomials, broadening the applicability of these formulas.

Contribution

It generalizes three reduction formulas for the denumerant functions to arbitrary sets using Bernoulli-Barnes polynomials.

Findings

Extended reduction formulas for denumerant functions.

Applied Bernoulli-Barnes polynomials to generalize previous results.

Provided a unified approach for various sets A.

Abstract

Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart, Sert\"oz-\"Ozl\"uk, and Brown-Chou-Shiue derived three reduction formulas for $p_A(n)$ for $A$ with three parameters. We extend their findings for general $A$ using the Bernoulli-Barnes polynomials.