Skip to search formSkip to main contentSkip to account menu

Pólya enumeration theorem

Known as: Pólya's enumeration theorem, Polya enumeration formula, Pólya's formula 
The Pólya enumeration theorem, also known as the Redfield–Pólya Theorem, is a theorem in combinatorics that both follows from and ultimately… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
In the article, the author gets to the bottom of the origin of Polya’s integral inequality, plots out the development of the… 
2013
2013
Abstract In this paper certain Turán-type inequalities for some Lommel functions of the first kind are deduced. The key tools in… 
2009
2009
Simple formulas for the number of different cyclic and dihedral necklaces containing nj beads of the j-th color, and , are… 
2008
2008
Analogous to the use of sums of squares of certain real-valued special functions to prove the reality of the zeros of the Bessel… 
2007
2007
In 2003, Ruscheweyh and Suffridge settled a conjecture of Pólya and Schoenberg on subordination of the de la Vallée Poussin means… 
2007
2007
Abstract Let $p$ be a prime greater than or equal to 17 and congruent to 2 modulo 3. We use results of Beukers and Helou on… 
2006
2006
Three methods and their extended versions for enumerating stereoisomers, which have been developed by modifying or simplifying… 
2006
2006
This article focuses on those problems about extremal properties of polynomials that were considered by the Hungarian… 
2002
2002
Let G(z) be an entire function of order less than 2 that is real for real z with only real zeros. Then we classify certain… 
Review
1991
Review
1991
Being a mathematician and a musician (I play the flute) I found it very interesting to deal with Polya’s counting theory in my…