The distribution of numbers with many factorizations
In the paper under review, the author studies the arithmetic function \(f(n)\) counting the number of ways of writing \(n\) as product of integers \(\geqslant 2\), where the order of the factors is not taken into account. This function was first introduced by \textit{P. A. MacMahon} [Proc. Lond. Math. Soc. (2) 22, 404--411 (1924; JFM 50.0083.02)], and its average order was discovered by \textit{A. Oppenheim} [J. Lond. Math. Soc. 2, 123--130 (1927; JFM 53.0157.02)]. In this interesting work, the author first extends a previous result of \textit{E. R. Canfield} et al. [J. Number Theory 17, 1--28 (1983; Zbl 0513.10043)] by showing that, for fixed \(\varepsilon > 0\) and \(\alpha \in \left( 0,1 \right)\), there exists a real number \(x_0 = x_0(\varepsilon,\alpha) > 0\) such that, for all \(x > x_0\) and each subset \(S\) of \(\left[ 1,x \right] \cap \mathbb{Z}\) of cardinality \(|S| \leqslant x^{1-\alpha}\), we have \[\sum_{n \in S} f(n) \leqslant x \, \exp \left( (\varepsilon - \alpha) \frac{\log x \log_3 x}{\log_2 x}\right)\] where \(\log_k\) is the \(k\)-fold iterated logarithm. As a consequence, the author establishes an estimate for the moments \(\sum_{n \leqslant x} f(n)^\beta\) with \(\beta > 1\). Finally, the author investigates the more intricate case when \(0 < \beta < 1\). Using a completely different method, he proves that, when \(\beta \in \left( 0,1 \right)\) is fixed, then, for all \(x\) sufficiently large, the estimate \[\sum_{n \leqslant x} f(n)^\beta = x \, \exp \left( (1+o(1)) (1-\beta)^{\frac{1}{1-\beta}} \log_2 x \left( \frac{\log_2 x}{\log_3 x}\right)^{\frac{\beta}{1-\beta}}\right).\] holds. The lower bound uses the fact that, when \(n\) is squarefree with \(\omega(n) = k\), then \(f(n) = B_k\) the \(k\)th Bell number, so that \(\sum_{n \leqslant x} f(n)^\beta \geqslant B_k^\beta \pi_k (x)\), whereas the upper bound follows from an observation of Oppenheim along with some effective uniform bounds for powers of the Dirichlet-Piltz divisor \(\tau_z(n)\) proved by \textit{K. K. Norton} [J. Number Theory 40, No. 1, 60--85 (1992; Zbl 0748.11046)].
- On the Diophantine equation \(\prod x_{i} = \sum x_{i}\)
- On the maximal order of numbers in the ``factorisatio numerorum problem
- On an additive arithmetic function
- scientific article; zbMATH DE number 5190486
- The distribution of numbers with many ordered factorizations
- scientific article; zbMATH DE number 3015574
- Autour du théorème de Bombieri-Vinogradov. II
- Asymptotics of an arithmetic sum.
- Average orders of certain arithmetical functions
- On the number of polynomial maps into Z_n
- Factorisatio numerorum with constraints
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 3900876 (Why is no real title available?)
- scientific article; zbMATH DE number 4118426 (Why is no real title available?)
- scientific article; zbMATH DE number 3010361 (Why is no real title available?)
- Improved bounds on Bell numbers and on moments of sums of random variables
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Multiplicative partitions
- Multiplicative partitions of numbers with a large squarefree divisor
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On highly factorable numbers
- On locally repeated values of certain arithmetic functions. II
- On the multiplicative partition function
- On the number of factorizations of an integer
- On the parity of the number of multiplicative partitions and related problems
- Popular subsets for Euler's \(\varphi \)-function
- Quadrafree \textit{factorisatio numerorum}
- Some results on Oppenheim's ``factorisatio numerorum function
- The average order of an arithmetic function
- The distribution of the number of factors in a factorization
- The Number of Factorizations of Numbers Less than x Into Divisors Greater than y
- The Number of Factorizations of Numbers Less than x into Factors Less than y
- Upper bounds for sums of powers of divisor functions
- Über die Anzahl der Produktzerlegungen ganzer Zahlen
- A ``supernormal partition statistic
- The distribution of numbers with many ordered factorizations
- On factorizations into coprime parts
- scientific article; zbMATH DE number 5367499 (Why is no real title available?)
- Some results on Oppenheim's ``factorisatio numerorum function
- The number of preimages of iterates of and
This page was built for publication: The distribution of numbers with many factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664683)
