The enumerative properties of combinatorial partition polynomials

zbMATH Open1249.05009MaRDI QIDQ3115244FDOQ3115244

Authors:

Publication date: 20 February 2012

Recommendations

• Recurrence relations and enumerative interpretations of some combinatorial numbers and polynomials
• On partition polynomials
• The theory of compositionals
• The Combinatorial Significance of a Theorem of Pólya
• The ABC's of classical enumeration

zbMATH Keywords

rooted treeenumerating treescombinatorial partition polynomialhomogeneous Platonov polynomialsSchroder's fourth problem

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Enumeration in graph theory (05C30)

Cited In (6)

• Combinatorial families enumerated by quasi-polynomials
• Title not available (Why is that?)
• The rank enumeration of certain parabolic non-crossing partitions
• The partition polynomial of a finite set system
• Quantitative versions of combinatorial partition theorems.
• An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers

This page was built for publication: The enumerative properties of combinatorial partition polynomials

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