A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
Let \(H(n)\) and \(P(n)\) represent the number of factorizations of the positive integer \(n\) into factors in which the order of the factors distinguishes factorizations, respectively in which the order of factors is immaterial. Let \(H_d(n)\) and \(P_d(n)\) be defined as \(H(n)\), respectively \(P(n)\), but where in addition we require that the factorization be into distinct parts. The authors survey results on these functions and in addition offer some new identities and observations for these and related counting functions. Furthermore they derive some new recursive algorithms to generate lists of factorizations with restrictions of various types.
- On the number counting of polynomial functions
- On the factorial base and related counting function
- Non-unique factorizations: a survey
- scientific article; zbMATH DE number 67555
- Counting the Integers Factorable via Cyclotomic Methods
- A generalized counting and factoring method for polynomials over finite fields
- Some aspects of factorization theory—a survey
- Counting factorisations of monomials over rings of integers modulo \(N\)
- On counting polynomials over finite fields
- On the number of factorizations of polynomials over finite fields
- A bijection for ordered factorizations
- A Bound for the Number of Multiplicative Partitions
- Addition theorems for sets of integers
- An asymptotic formula for extended Eulerian numbers
- Compositions with distinct parts
- Distribution of the number of factors in random ordered factorizations of integers
- Extended Bernoulli and Eulerian numbers
- Factorisatio numerorum with constraints
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On highly factorable numbers
- On Product Partitions of Integers
- On some asymptotic formulas in the theory of the ``factorisatio numerorum
- On the Number of Multiplicative Partitions
- On the number of ordered factorizations of natural numbers
- Recursive formulae for the multiplicative partition function
- The distribution of the number of factors in a factorization
- Über die Anzahl der Produktzerlegungen ganzer Zahlen
- Labeled factorization of integers
- Factorisatio numerorum with constraints
- Fourier series of functions involving higher-order ordered Bell polynomials
- On representations of ternary order relations in numeric strings
- On a conjecture of Wilf
- On prime-perfect numbers
- On asymptotic behavior of Dirichlet inverse
- Dirichlet generating functions and factorization identities
- On the factorial base and related counting function
- Quadrafree \textit{factorisatio numerorum}
- Fourier series of higher-order ordered Bell functions
- On the treatment of partitions as factorization and further analysis
- Unordered factorizations with \(k\) parts
- Divisor functions and the number of sum systems
- Fourier series of sums of products of ordered Bell and poly-Bernoulli functions
- Some results on ordered and unordered factorization of a positive integer
- Multifactorisations and divisor functions
- Counting points by height in semigroup orbits
- On the maximal order of numbers in the ``factorisatio numerorum problem
- Large values and champion numbers of Kalmár's arithmetic function
This page was built for publication: A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716128)
