Notes on higher-dimensional partitions

From MaRDI portal
Publication:1940372

DOI10.1016/J.JCTA.2012.11.005zbMATH Open1259.05018arXiv1203.4419OpenAlexW2103854120MaRDI QIDQ1940372FDOQ1940372


Authors: Suresh Govindarajan Edit this on Wikidata


Publication date: 6 March 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1203.4419




Recommendations





Cited In (7)





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)