Asymptotic formulae concerning arithmetical functions defined by cross-convolutions. III: On the function _k

DOI10.1023/A:1004357011624MaRDI QIDQ1276310zbMATH OpenOpenAlexFDO

Authors László Tóth

Publication date 24 January 1999

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1004357011624

zbMATH Keywords

arithmetic functions asymptotic formula cross-convolutions divisor function Narkiewicz's regular convolution

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Asymptotic results on arithmetic functions (11N37)

Review text

[Part I, cf. Publ. Math. 50, 159-176 (1997; Zbl 0881.11007); Parts IV and V, Mathematika 39, No. 1, 137-141 (1997; Zbl 0905.11006), No. 2, 305-312 (1997; Zbl 0905.11007).] The author defines a regular convolution \(A\) of Narkiewicz to be a cross-convolution if for every prime \(p\) we have either \(A(p^a)=\{1,p,p^2,\ldots ,p^a\}\) for every \(a\in \mathbb N\) or \(A(p^a)=\{1,p^a\}\) for every \(a\in \mathbb N\). The function \(\tau _{A,k}(n)\) is the following generalization of the function \(\tau _k(n)\). Let \(A\) be a regular convolution and let \(k\in \mathbb N\). \(\tau _{A,k}(n)\) denotes the number of ordered \(k\)-tuples \(\langle a_1,a_2,\ldots ,a_k\rangle\) of positive integers such that \(n=a_1a_2\ldots a_k\) and \(a_1,a_2,\ldots ,a_k \in A(n)\). After several lemmas, asymptotic formulae are proved for the summatory functions \[ \sum_{n\leq x,\;(n,u)=1} \tau_{A,k}(n), \] where \(A\) is a cross-convolution, \(u\in N\) and \(k\geq 2\). The theorems of the paper generalize the results obtained by special convolutions as Dirichlet- or unitary-convolution.

Cited in

(10)

This page was built for publication: Asymptotic formulae concerning arithmetical functions defined by cross-convolutions. III: On the function \(\tau_k\)

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