On multiplicative functions with bounded partial sums
From MaRDI portal
Abstract: Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in some finite set P, then the answer is yes. We also discuss a result of Bronstein that shows that functions modified from characters at a finite number of places.
Let \(P\) a set of primes. The author calls an arithmetical function \(f: \mathbb N\to\mathbb C\) \(P\)-multiplicative, if \(f(pn)= f(p)f(n)\), \(p\in P\), \(n\in\mathbb N\). He discusses a special case of the Erdős discrepancy problem: he constructs for every finite \(P\) a \(P\)-multiplicative function \(f: \mathbb N\to\{1, -1\}\) with bounded partial sums.
Recommendations
Cited in
(8)- On functions with bounded remainder
- Mock characters and the Kronecker symbol
- The bound of sums of multiplicative functions with shifted arguments
- Complex valued multiplicative functions with bounded partial sums
- Tao's resolution of the Erdős discrepancy problem
- Multiplicative functions that are close to their mean
- Beyond the Erd\H{o}s discrepancy problem in function fields
- Multiplicative functions of locally finite partially ordered sets. Multiplicativity criteria
This page was built for publication: On multiplicative functions with bounded partial sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911037)