Counting the number of solutions of equations in groups by recurrences (Q2746554)

Let \((G, \ast)\) be a finite group. Let \(a\in G\), \(T\subseteq G\) and let \(N(T,k,a)\) denote the number of solutions of the equation \(x_1\ast x_2\ast \cdots\ast x_k=a\), where \(x_i\in T\). The authors show that \(N(T,k,a)\) is always a linearly recurrent sequence and study its degree. Polynomials of recurrences in the cases of the additive group of integers modulo \(n\) and the group of symmetries of a regular polygon of \(n\) sides are considered.