Multiplicative functions and Brun's sieve
Let A be a finite set of positive integers with certain conditions imposed on the subsets \(A_ d=\{a\in A|\) \(a\equiv 0 (mod d)\}\). For a strongly multiplicative function g, let \(g_ y(n)=\prod _{p| n,\quad p<y}g(p)\). It is shown that the sum \[ (*)\quad S_ g(A,y)=\sum _{n\in A}g_ y(n) \] generalizes the standard counting function of the sieve and also satisfies Buchstab type identities like the latter. When \(0\leq g\leq 1\), the combinatorial sieve is used to estimate \(S_ g(A,y)\). In this case g(n) can be written as \(e^{uf(n)}\), where \(u\leq 0\) and \(f\geq 0\), an additive function and so (*) can be interpreted in terms of the Laplace transform of f. This gives a new method to study the distribution of f(n), for \(n\in A\). Another interesting observation in this paper is that even when -1\(\leq g(p)\leq 0\) on primes p, the pure sieve of Brun can be employed to estimate \(S_ g(A,y)\) despite the oscillation in sign of g(n).
- The fundamental lemma of Brun's sieve in a new setting
- A new sieve for restricted multiset counting
- The local distribution of the number of small prime factors: variation of the classical theme
- Sieve functions in arithmetic bands
- scientific article; zbMATH DE number 4085756 (Why is no real title available?)
This page was built for publication: Multiplicative functions and Brun's sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735795)