Enumeration of partitions via socle reduction

Abstract

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional partitions, satisfying suitable constraints on their embedding dimension and socle type. We provide exact formulas for the generating functions of several infinite families of such partitions, and design a procedure enumerating them in the general case. As a proof of concept, we determine the number of partitions of size up to 30 in any dimension.