Unordered factorizations with k parts
From MaRDI portal
Publication:5113653
Abstract: We derive new formulas for the number of unordered (distinct) factorizations with parts of a positive integer as sums over the partitions of and an auxiliary function, the number of partitions of the prime exponents of , where the parts have a specific number of colors. As a consequence, some new relations between partitions, Bell numbers and Stirling number of the second kind are derived. We also derive a recursive formula for the number of unordered factorizations with different parts and a simple recursive formula for the number of partitions with different parts.
Recommendations
Cites work
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 3365285 (Why is no real title available?)
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- A note on the partitions involving parts of \(k\) different magnitudes
- Dirichlet generating functions and factorization identities
- Enumerative combinatorics. Volume 2.
- Multiplicative partitions
- On Product Partitions of Integers
- On the number of partitions into parts of \(k\) different magnitudes
- On unordered multiplicative partitions
- Product partitions and recursion formulae
- The distribution of the number of factors in a factorization
Cited in
(5)- Labeled factorization of integers
- scientific article; zbMATH DE number 434783 (Why is no real title available?)
- On asymptotic behavior of Dirichlet inverse
- scientific article; zbMATH DE number 5233141 (Why is no real title available?)
- Some results on ordered and unordered factorization of a positive integer
This page was built for publication: Unordered factorizations with \(k\) parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113653)