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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Although the Pólya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2014
2014
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… (More)
Is this relevant?
2014
2014
Homogeneous rotation symmetric (invariant under cyclic permutation of the variables) Boolean functions have been extensively… (More)
Is this relevant?
2009
2009
  • L. G. Fel
  • Intelligent Information Management
  • 2009
Simple formulas for the number of different cyclic and dihedral necklaces containing nj beads of the j-th color, and , are… (More)
Is this relevant?
2009
2009
Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of… (More)
Is this relevant?
2006
2006
Three methods and their extended versions for enumerating stereoisomers, which have been developed by modifying or simplifying… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper investigates necessary and sufficient conditions for the existence of an affine parameter-dependent Lyapunov function… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A functional limit theorem is proved for multitype continuous time Markov branching processes. As consequences, we obtain limit… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A rich and  exible class of random probability measures, which we call stick-breaking priors, can be constructed using a… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In 1959 Read [6] determined an exact formula for the number of labelled ..1-regular graphs on n vertices. This formula, whose… (More)
Is this relevant?