Abstract: We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the number of particular types of skew Ferrers diagrams. The end result of our analysis is the existence of a triangle, that we denote by F, which implies that the data needed to compute the number of partitions of a given positive integer is reduced by a factor of half. The number of spanning rooted forests appears intriguingly in a family of entries in the triangle F. Using modifications of an algorithm due to Bratley-McKay, we are able to directly enumerate entries in some of the triangles. As a result, we have been able to compute numbers of partitions of positive integers <= 25 in any dimension.
Recommendations
- scientific article; zbMATH DE number 5919296
- On the multi-dimensional partitions of small integers
- MacMahon’s statistics on higher-dimensional partitions
- Asymptotic results for the number of multidimensional partitions of an integer and directed compact lattice animals
- On the asymptotics of higher dimensional partitions
Cited in
(7)- Notes on plane partitions. VI
- Bounds for the number of multidimensional partitions
- On the multi-dimensional partitions of small integers
- Bounds on the number of higher-dimensional partitions
- On the cardinality of lower sets and universal discretization
- Notes on plane partitions. V
- MacMahon’s statistics on higher-dimensional partitions
This page was built for publication: Notes on higher-dimensional partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940372)
