The Combinatorial Significance of a Theorem of Pólya
From MaRDI portal
Publication:3255354
Recommendations
Cited in
(20)- Generalizations of theorems of Wilson, Fermat and Euler
- Automating Pólya theory: The computational complexity of the cycle index polynomial
- The enumerative properties of combinatorial partition polynomials
- scientific article; zbMATH DE number 6118169 (Why is no real title available?)
- Enumerations for Permutations in Difference Form
- Counting circular caterpillars
- Applications of Polya’s theorem to distribution problems and partitions of integers
- scientific article; zbMATH DE number 4006278 (Why is no real title available?)
- scientific article; zbMATH DE number 1028226 (Why is no real title available?)
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett Theorem
- scientific article; zbMATH DE number 205337 (Why is no real title available?)
- scientific article; zbMATH DE number 815883 (Why is no real title available?)
- scientific article; zbMATH DE number 1389217 (Why is no real title available?)
- Some differential properties of Pólya's cycle indicators
- Counting theory according to Pólya
- A generalized form of Pòlya's counting method
- Nonequivalent periodic subsets of the lattice.
- On weight of the Pólya-Redfield-de Bruijn counting and twelvefold way
- Polya enumeration theorems in algebraic geometry
- A recursion of the Pólya polynomial for the symmetric group
This page was built for publication: The Combinatorial Significance of a Theorem of Pólya
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3255354)