Order polynomials and Pólya's enumeration theorem. (Q405267)

Summary: Pólya's enumeration theorem states that the number of labelings of a finite set up to symmetry is given by a polynomial in the number of labels. We give a new perspective on this theorem by generalizing it to partially ordered sets and order preserving maps. Further we prove a reciprocity statement in terms of strictly order preserving maps generalizing a classical result by \textit{R. P. Stanley} [in: Proc. 2nd Chapel Hill Conf. Combin. Math. Appl., Univ. North Carolina 1970, 421-427 (1970; Zbl 0215.05401)]. We apply our results to counting graph colorings up to symmetry.