Convolutions of completely multiplicative functions (Q1924580): Difference between revisions

We characterize the convolution \(f\) of \(k\) completely multiplicative functions by their Bell series, and by the vanishing of determinants similar to Hankel determinants, and give recursive formulas, which express the higher values \(f(p^n)\), \(n>k\) by \(f(p), f(p^2), \dots, f(p^k)\). This generalizes theorems for \(k=2\) of \textit{P. J. McCarthy} [Introduction to arithmetical functions. New York: Springer (1986; Zbl 0591.10003)].