Rectangle partitions generalizing integer partitions

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a rectangle are indistinguishable if they consist of the same multiset of blocks, their geometric arrangement does not matter.