On a class of arithmetic convolutions involving arbitrary sets of integers
László Tóth
Abstract
Let d,n be positive integers and S be an arbitrary set of positive integers. We say that d is an S-divisor of n if d|n and gcd (d,n/d)∈ S. Consider the S-convolution of arithmetical functions given by (1.1), where the sum is extended over the S-divisors of n. We determine the sets S such that the S-convolution is associative and preserves the multiplicativity of functions, respectively, and discuss other basic properties of it. We give asymptotic formulae with error terms for the functions σS(n) and τS(n), representing the sum and the number of S-divisors of n, respectively, for an arbitrary S. We improve the remainder terms of these formulae and find the maximal orders of σS(n) and τS(n) assuming additional properties of S. These results generalize, unify and sharpen previous ones. We also pose some problems concerning these topics.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu