An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers

DOI10.1007/S10587-005-0049-2MaRDI QIDQ3366743zbMATH OpenOpenAlexFDO

Authors Xiaojun Wu, Chong-Yun Chao

Publication date 14 February 2006

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/30972

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Recommendations

• Applications of Polya’s theorem to distribution problems and partitions of integers
• A partition of the non-negative integers, with applications
• On the poset of partitions of an integer
• The enumerative properties of combinatorial partition polynomials
• scientific article; zbMATH DE number 819114
• An Erdős-Ko-Rado theorem for subset partitions

Cites work

• A Note on Solid Partitions
• Gaussian limiting distributions for the number of components in combinatorial structures
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen

Cited in

(5)

• Partition identities involving gaps and weights. II
• Applications of Polya’s theorem to distribution problems and partitions of integers
• scientific article; zbMATH DE number 1389217 (Why is no real title available?)
• The twelvefold way, the nonintersecting circles problem, and partitions of multisets
• Alternating quaternary algebra structures on irreducible representations of \(\mathfrak{sl}_2(\mathbb C)\)

This page was built for publication: An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366743)