Order polynomials and Pólya's enumeration theorem.
The electronic journal of combinatorics, Tome 21 (2014) no. 2
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 Stanley (1970). We apply our results to counting graph colorings up to symmetry.
DOI :
10.37236/4066
Classification :
06A07, 06A11, 05A19, 05C15, 05C31, 05E18
Mots-clés : Pólya enumeration, group actions, partially ordered sets, order preserving maps, graph colorings
Mots-clés : Pólya enumeration, group actions, partially ordered sets, order preserving maps, graph colorings
Affiliations des auteurs :
Katharina Jochemko  1
@article{10_37236_4066,
author = {Katharina Jochemko},
title = {Order polynomials and {P\'olya's} enumeration theorem.},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {2},
doi = {10.37236/4066},
zbl = {1309.06003},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4066/}
}
Katharina Jochemko. Order polynomials and Pólya's enumeration theorem.. The electronic journal of combinatorics, Tome 21 (2014) no. 2. doi: 10.37236/4066
Cité par Sources :