How symmetric can a function be? Original Research Article

The symmetric complexity of a polynomial in n variables is defined as the number of times the fundamental theorem on symmetric functions is applicable. In this paper a sharp upper bound on this measure is derived by a matrix method.