2018
DOI: 10.1142/s1793042118500781
|View full text |Cite
|
Sign up to set email alerts
|

Derivation of arithmetical functions under the Dirichlet convolution

Abstract: We present the group-theoretic structure of the classes of multiplicative and firmly multiplicative arithmetical functions of several variables under the Dirichlet convolution, and we give characterizations of these two classes in terms of a derivation of arithmetical functions. MSC: 11A25f (n 1 ) · · · f (n r ) is firmly multiplicative. On the other hand, the function gcd(n 1 , . . . , n r ) is multiplicative but not firmly multiplicative for r ≥ 2. Further examples can be found, e.g., in [5,10,11]. A survey … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 11 publications
(17 reference statements)
0
6
0
Order By: Relevance
“…The theory of multiplicative arithmetical functions of several variables originates to the seminal paper of Vaidyanathaswamy [12] from 1931. Recently, this theory has been developed, e.g., in [3,6,11]. Formal power series is a useful tool in this theory as was already noted in [12].…”
Section: Applications To Multiplicative Arithmetical Functionsmentioning
confidence: 92%
“…The theory of multiplicative arithmetical functions of several variables originates to the seminal paper of Vaidyanathaswamy [12] from 1931. Recently, this theory has been developed, e.g., in [3,6,11]. Formal power series is a useful tool in this theory as was already noted in [12].…”
Section: Applications To Multiplicative Arithmetical Functionsmentioning
confidence: 92%
“…Remark 3.1. In (7), the summation over k is finite. It suffices that k runs through the integers from 1 to Ω(n) + 1, where Ω(n) is the total number of prime factors of n, each being counted according to its multiplicity, with Ω(1) = 0.…”
Section: An Explicit Expression For Quotientmentioning
confidence: 99%
“…Remark 3.1. In (7), the summation over k is finite. It suffices that k runs through the integers from 1 to Ω(n) + 1, where Ω(n) is the total number of prime factors of n, each being counted according to its multiplicity, with Ω(1) = 0.…”
Section: An Explicit Expression For Quotientmentioning
confidence: 99%
“…Proof. We proceed by induction on n. For n = 1, the right side of ( 7) is g(c)/h(b) and hence (7) holds.…”
Section: An Explicit Expression For Quotientmentioning
confidence: 99%