Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03190965n
Noun Named Entity
EL
No term available
EN
The Pólya enumeration theorem, also known as the Redfield–Pólya theorem and Pólya counting, is a theorem in combinatorics that both follows from and ultimately generalizes Burnside's lemma on the number of orbits of a group action on a set. Wikipedia
Relations
Sources
IS A
θεώρημα

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License