Some Remarks on the Number of Solutions to the Equation f(X1) + … + f(Xn) = 0
David R. Richman · Studies in Applied Mathematics · 1984
Let S, T be finite sets, and let f be a function from S to T. Fix an element t in T, and let cn denote the number of n‐tuples (X1,…,Xn) satisfying f(X1) + … + f(Xn) = t here + denotes any binary operation on T. The sequence c1, c2,… satisfies a linear recurrence relation of degree at most |T|.