In combinatorics, P\'{ o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{ o}lya's Enumeration Theorem. As an application, we derive a formula that expresses the $n$-th elementary symmetric polynomial in $m$ indeterminates (where $n\leq m$) as a variant of the cycle index polynomial of the symmetric group $\mathrm{ Sym}(n)$. This result resolves a problem posed by Amdeberhan in 2012.
Categories: math.CO