The degree of a function between two abelian groups has been defined as the smallest natural number such that vanishes after applications of any of the difference operators defined by . Functions of finite degree have also been called generalized polynomials or solutions to Fr\'echet's functional equations. A pivotal result by A. Leibman (2002) is that . We show how results on the degree can be used (i) to get lower bounds on the number of solutions of equations, and (ii) to connect nilpotency and supernilpotency. This leads to generalizations of the Chevalley-Warning Theorems to abelian groups, a group version of the Ax-Katz Theorem on the number of zeros of polynomial functions, and a computable such that all finite -nilpotent algebras of prime power order in congruence modular varieties are -supernilpotent.
The degree as a measure of complexity of functions on a universal algebra