Multiplicative partitions of numbers with a large squarefree divisor
type: Item
instance of: scholarly article
title: Multiplicative partitions of numbers with a large squarefree divisor
zbMATH Open document ID: 1486.11120
author: Paul Pollack
published in: The Ramanujan Journal
publication date: 2021-05-06T00:00:00Z
review text: For a positive integer \(n\), write \(f(n)\) for the number of multiplicative partitions of \(n\), i.e., the number of decompositions of \(n\) as a product of integers larger than \(1\), where two decompositions are considered to be equal if they differ only by the order of the factors. Writing \[ L(x) = \exp\left(\log x \frac{\log_3 x}{\log_2 x}\right), \] \textit{E. R. Canfield} et al. [J. Number Theory 17, 1--28 (1983; Zbl 0513.10043)] proved that \[ \max_{n \leq x} f(n) = x/L(x)^{1+o(1)}. \] Previous work of \textit{A. Oppenheim} [J. Lond. Math. Soc. 1, 205--211 (1926; JFM 52.0163.02)] implied (after a correction) that \[ \max_{\substack{n \leq x \\ n \text{ square-free}}} f(n) = x/L(x)^{2+o(1)}. \] The paper under review interpolates between these two results by showing that \[ \max_{\substack{n \leq x \\ \operatorname{rad}(n) \geq n^\alpha}} f(n) = x/L(x)^{1+\alpha+o(1)}, \] where \(\operatorname{rad}(n)\) is the radical of \(n\), i.e. the largest square-free divisor of \(n\). The author's orginal motivation to study this is an application concerning value distribution of the Euler \(\varphi\)-function. Writing \(F(n) = \# \varphi^{-1}(n)\) for the number of pre-images of \(n\), the author considers \[ \max_{0 < |P(n)| \leq x} F(|P(n)|) \] with \(P(n)\) a non-zero polynomial with at least two distinct complex roots. Assuming the abc conjecture, the author shows (in a precise sense) that this maximum is of smaller order of magnitude than a known (conditional) asymptotic estimate for \[ \max_{n \leq x} F(n), \] i.e. he shows that \(P(n)\) cannot be as popular value of \(\varphi(n)\) as possible.
reviewed by: Kaisa Matomäki
Mathematics Subject Classification ID: 11N56
Mathematics Subject Classification ID: 11A51
Mathematics Subject Classification ID: 11N32
Mathematics Subject Classification ID: 11N64
zbMATH DE Number: 7345289
zbMATH Keywords: multiplicative partition
zbMATH Keywords: factorization
zbMATH Keywords: divisor functions
zbMATH Keywords: abc conjecture
MaRDI profile type: Publication
full work available at URL: s11139-019-00188-3
OpenAlex ID: W2991351778
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Q3219268
cites work: Q4252228
cites work: Some remarks on Euler’s 𝜙 function and some related problems
cites work: On locally repeated values of certain arithmetic functions. II
cites work: PRODUCTS OF SHIFTED PRIMES SIMULTANEOUSLY TAKING PERFECT POWER VALUES
cites work: Q4235425
cites work: Q4025976
cites work: Upper bounds for sums of powers of divisor functions
cites work: How often is Euler's totient a perfect power?
cites work: Popular values of Euler's function
cites work: On the distribution of amicable numbers. II.
cites work: Q4732505
cites work: Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
cites work: Q4876875
cites work: Q3826651
Wikidata QID: Q126774699
DOI: 10.1007/S11139-019-00188-3
Recommended article: Q4216443
Recommended article: Q4022272
Recommended article: ON A CERTAIN GENERAL EXPONENTIAL SUM
Recommended article: Q3762395
Recommended article: Growth of the product $∏^n_{j=1} (1-x^{a_j})$
Recommended article: On the number of prime factors of summands of partitions
Recommended article: Q3634702
Recommended article: Q4232837
Recommended article: On the frequencies of large values of divisor functions
Recommended article: Q3483355
description: scientific article; zbMATH DE number 7345289