I am looking whether there is any compact way to write the following: Suppose we have an abelian group $G$. For a subset $A\subset G$ let $S_A$ be the sum of its elements. I want to find the number of triples of $k$-element subsets $(A,B,C)$ with $S_A+S_B+S_C=0$.
There is an obvious way to do it by just summing over any triple $(x,y,z)\in G$ with $x+y+z=0$ and writing how many sets have $S_A=x$, $S_B=y$, $S_C=z$ (there are expressions for these counts in the literature), but this does not lead to a nice compact expression, or at least I do not see the simplifications.