The Wallach series $W_k(q) = 1+ \sum_{d\ge 1} c_d(k) q^d$ was created
by Nolan Wallach. It has a nice expression for k = 1, 2, 3, 4 and a
large expression for k = 5. The k < 5 cases were done by using
invariant theory, symmetric function theory, and by a purely
combinatorial approach. The k = 5 case was first predicted by
Wallach. I will show several ways to compute the Wallach series of the
k = 5 case. Our starting point is a related problem of counting
solutions of a linear Diophantine system: assign a nonnegative integer
label for each vertex of a k-cube such that the sum of the labels for
every face are equal. This is a joint work with A. Garsia, G. Musiker,
N. Wallach, and M. Zabrocki.