Categorification of some integer sequences and higher dimensional partitions. (English) Zbl 1308.05014
Summary: In this paper, we prove that the number of some 3-dimensional partitions is given by the number of indecomposable objects of some posets of finite representation type.
MSC:
| 05A17 | Combinatorial aspects of partitions of integers |
| 11D09 | Quadratic and bilinear Diophantine equations |
| 11D45 | Counting solutions of Diophantine equations |
| 11D85 | Representation problems |
| 11E25 | Sums of squares and representations by other particular quadratic forms |
| 11E57 | Classical groups |
| 06A07 | Combinatorics of partially ordered sets |
