On the integer partitions recursive structure

Abstract

Sylvester showed that the partition of an integer into a set of positive integers can be represented as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. The wave itself is a weighted sum of the polynomial terms multiplied by the periodic functions. The integer weights are found to be a sum of partitions into a smaller set of integers implying the recursive structure of integer partitions.