On the binomial convolution of arithmetical functions

From MaRDI portal
Publication:2880103

zbMATH Open1242.11008arXiv0806.0508MaRDI QIDQ2880103FDOQ2880103


Authors: László Tóth, Pentti Haukkanen Edit this on Wikidata


Publication date: 12 April 2012

Published in: Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: Let n=prodppup(n) denote the canonical factorization of ninN. The binomial convolution of arithmetical functions f and g is defined as where is the binomial coefficient. We provide properties of the binomial convolution. We study the C-algebra (calA,+,circ,C), characterizations of completely multiplicative functions, Selberg multiplicative functions, exponential Dirichlet series, exponential generating functions and a generalized binomial convolution leading to various M"obius-type inversion formulas. Throughout the paper we compare our results with those of the Dirichlet convolution *. Our main result is that (calA,+,circ,C) is isomorphic to (calA,+,,C). We also obtain a "multiplicative" version of the multinomial theorem.


Full work available at URL: https://arxiv.org/abs/0806.0508




Recommendations





Cited In (14)





This page was built for publication: On the binomial convolution of arithmetical functions

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