On the binomial convolution of arithmetical functions
From MaRDI portal
Publication:2880103
Abstract: Let denote the canonical factorization of . The binomial convolution of arithmetical functions and is defined as where is the binomial coefficient. We provide properties of the binomial convolution. We study the -algebra , 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 is isomorphic to . We also obtain a "multiplicative" version of the multinomial theorem.
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 6166132 (Why is no real title available?)
- scientific article; zbMATH DE number 7134756 (Why is no real title available?)
- A note on characterizing completely multiplicative functions using generalized Möbius functions
- On the \(k\)-ary convolution of arithmetical functions
- B-binomial convolution and associated arithmetical functions and their properties
- scientific article; zbMATH DE number 3588747 (Why is no real title available?)
- A remark on the binomial theorem and Möbius inversion
- scientific article; zbMATH DE number 1994532 (Why is no real title available?)
- Binomial convolution and associated with Ramanujan sums
- scientific article; zbMATH DE number 942874 (Why is no real title available?)
- A certain functional algebra
- On generalised Möbius inversion formulas
- An isomorphism between the convolution product and the componentwise sum connected to the D'Arcais numbers and the Ramanujan tau function
- Dirichlet convolution and the Binet formula
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)