Concepts2
∑MathAdvanced
Pólya Enumeration
Pólya Enumeration Theorem generalizes Burnside’s Lemma by turning counting under symmetry into a polynomial substitution problem.
#pólya enumeration#cycle index#burnside lemma+12
∑MathAdvanced
Stirling Numbers of First Kind
Stirling numbers of the first kind count permutations by their number of cycles and connect power polynomials to rising/falling factorials.
#stirling numbers of the first kind#unsigned cycle numbers#signed stirling numbers+12