partition analysis is a term coined by macmahon for its algorithmic approach to the construction of explicit solutions of diophantine systems. this algorithm has recently been implemented in maple and mathematica. after a brief introduction to the algorithm we show its power and limitations in its application to a remarkable diophantine system. our task is to enumerate the number of ways of assigning weights to the vertices of the hypercube so that all the maximal faces carry the same weight. some solutions to this problem are given and its intimate connection to representation theory will be also be discussed.