A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts (Q2048548)

When is \(m\) is a prime power, the author proves that the first differences of partitions into at most \(m\) parts can be expressed as a non-negative linear combination of partitions into at most \(m-1\) parts. The techniques used to prove this result can be applied to determine when partitions with parts from a finite set positive integers \(A\) can be expressed as a non-negative linear combination of partitions with parts from a finite set positive integers \(B\).