Some Remarks on the Number of Solutions to the Equation f(X1) + … + f(Xn) = 0
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 (X 1,…,Xn ) satisfying f(X 1) + … + f(Xn ) = t here + denotes any binary operation on T. The sequence c 1, c 2,… satisfies a linear recurrence relation of degree at most |T|.
No Supplementary Data
No Article Media
Document Type: Research Article
Affiliations: University of South Carolina
Publication date: December 1, 1984