Rectangle Partitions Generalizing Integer Partitions
Abstract 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.
Authors
- Maciej Zakarczemny (ORCID: https://orcid.org/0000-0002-7202-1244)
- Krystian Gajdzica (ORCID: https://orcid.org/0000-0002-5603-5128)
- Robin Visser
Institutions
- Jagiellonian University (PL)
- Charles University (CZ)
- Cracow University of Technology (PL)
Publication Details
- Journal
- Annals of Combinatorics
- Published
- 2026-04-28
- DOI
- https://doi.org/10.1007/s00026-026-00826-w
- Primary Topic
- Advanced Mathematical Identities
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Univerzita Karlova v Praze
- Narodowe Centrum Nauki