Polya Enumeration Theorem

High Quality Content by WIKIPEDIA articles! The Polya enumeration theorem (PET), also known as the Redfield-Polya Theorem, is a theorem in combinatorics that both follows and ultimately generalizes Burnside\'s lemma on the number of orbits of a group action on a set. The theorem was first published by John Howard Redfield in 1927. In 1937 it was independently rediscovered by George Polya, who then greatly popularized the result by applying it to many counting problems, in particular to the enumeration of chemical compounds. Dannoe izdanie predstavlyaet soboj kompilyatsiyu svedenij, nahodyaschihsya v svobodnom dostupe v srede Internet v tselom, i v informatsionnom setevom resurse "Vikipediya" v chastnosti. Sobrannaya po chastotnym zaprosam ukazannoj tematiki, dannaya kompilyatsiya postroena po printsipu podbora blizkih informatsionnyh ssylok, ne imeet samostoyatelnogo syuzheta, ne soderzhit nikakih analiticheskih materialov, vyvodov, otsenok moralnogo, eticheskogo, politicheskogo, religioznogo i mirovozzrencheskogo haraktera v otnoshenii glavnoj tematiki, predstavlyaya soboj isklyuchitelno faktologicheskij material. This book was created using print-on-demand technology.