Macmahon's partition analysis IX: K-gon partitions

MACMAHON’S PARTITION ANALYSIS IX: k-GON PARTITIONS

MacMahon devoted a significant portion of Volume II of his famous book “Combinatory Analysis” to the introduction of Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. In a series of papers we have shown that MacMahon’s method turns into an extremely powerful tool when implemented in comput...

Partition Analysis Xii: Plane Partitions

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

Macmahon’s Partition Analysis Xi: Hexagonal Plane Partitions

In this paper we continue the partition explorations made possible by Omega, the computer algebra implementation of MacMahon’s Partition Analysis. The focus of our work has been partitions associated with directed graphs. The graphs considered here are made up of chains of hexagons, and the related generating functions are infinite products. Somewhat unexpectedly, while the generating functions...

Macmahon’s Partition Analysis Xii: Plane Partitions

MacMahon developed partition analysis as a calculational and analytic method to produce the generating function for plane partitions. His efforts did not turn out as he had hoped, and he had to spend nearly twenty years finding an alternative treatment. This paper provides a detailed account of our retrieval of MacMahon’s original project. One of the key results obtained with partition analysis...