What the study found
The study introduces a geometric extension of the partition function by counting partitions of a rectangle into rectangular blocks with integer sides. Two partitions are treated as the same when they contain the same multiset of blocks, regardless of how the blocks are arranged.
Why the authors say this matters
The authors describe this as a natural extension of integer partitions into a geometric setting. The abstract does not state further implications beyond this framing.
What the researchers tested
The researchers investigated the problem of counting partitions of a rectangle into rectangular blocks with integer sides. They defined indistinguishable partitions as those with the same multiset of blocks, with geometric arrangement ignored.
What worked and what didn't
The abstract states that the paper introduces this counting problem and frames it as a natural extension of the partition function. It does not report specific numerical results, comparisons, or methods that succeed or fail.
What to keep in mind
The available abstract is very brief and does not describe detailed results, proofs, or limitations. No further caveats are stated in the provided summary.
Key points
- The paper studies partitions of a rectangle into smaller rectangles with integer side lengths.
- Partitions are considered identical if they use the same multiset of blocks, even if arranged differently.
- The authors present this as a natural geometric extension of the partition function.
- The abstract does not give detailed results, proofs, or numerical findings.
Disclosure
- Research title:
- Rectangle partitions extend integer partitions
- Authors:
- Krystian Gajdzica, Robin Visser, Maciej Zakarczemny
- Institutions:
- Jagiellonian University, Charles University, Cracow University of Technology
- Publication date:
- 2026-04-28
- OpenAlex record:
- View
Get the weekly research newsletter
Stay current with peer-reviewed research without reading academic papers — one filtered digest, every Friday.