A Theorem of Molien Type in Combinatorics

Torbjörn Tambour
1989 European journal of combinatorics (Print)  
In this note we give a simple proof of a special case of the Polya enumeration theorem , and also a new proof of Burnside's lemma.
doi:10.1016/s0195-6698(89)80049-6 fatcat:a3rdk26jsnddvenpb4bqr32pua