Multiplicative functions arising from the study of mutually unbiased bases

We introduce two families of multiplicative functions, which generalize the somewhat unusual function that was serendipitously discovered in 2010 during a study of mutually unbiased bases in the Hilbert space of quantum physics. In addition, we report yet another multiplicative function, which is also suggested by that example; it can be used to express the squarefree part of an integer in terms of an exponential sum.

A study on some generalized multiplicative and generalized additive arithmetic functions

In this paper by an arithmetic function we shall mean a real-valued function on the set of positive integers. We recall the definitions of some common arithmetic convolutions. We also recall the definitions of a multiplicative function, a generalized multiplicative function (or briefly a GM-function), an additive function and a generalized additive function (or briefly a GA-function). We shall study in details some properties of GM-functions as well as GA-functions using some particular arithmetic convolutions namely the Narkiewicz’s A-product and the author’s B-product. We conclude our discussion with some examples.

On Primes of the Form 2x-q (where q is a prime less than or equal to x) and the Product of the Distinct Prime Divisors of an Integer (Revised): A Function Approach to Proving the Goldbach Conjecture by Mathematical Induction

This paper is really an attempt to solve the age-old problem of the Goldbach Conjecture, by restating it in terms of primes of the form 2x-q (where q is a prime less than or equal to x). Restating the problem merely requires us to ask the question: Does a prime of form 2x-q lie in the interval [x, 2x]? We begin by introducing the product, m, of numbers of the form 2x-q. Using the geometric series, an upper bound is estimated for the function m. Next, we prove a theorem that states every even number, 2x, that violates Goldbach’s Conjecture must satisfy an inequality involving a simple multiplicative function defined as the product, ρ(m), of the distinct prime divisors of m. A proof of the Goldbach Conjecture is then evident by contradiction as a corollary to the proof of the inequality.

Density modulo 1 of a sequence associated to some multiplicative functions evaluated at polynomial arguments

International audience We study density modulo 1 of the sequence with general term ∑ m≤n f (G(m)) where f is the strongly multiplicative function of the form f (n) = ∏ p|n (1 − ν(p) p) and ν is a multiplicative function for which there exists a real number 0 < r ≤ 1 such that 1 ≤ |ν(p)| ≤ p

Additive uniqueness of PRIMES − 1 for multiplicative functions

Let [Formula: see text] be the set of all primes. A function [Formula: see text] is called multiplicative if [Formula: see text] and [Formula: see text] when [Formula: see text]. We show that a multiplicative function [Formula: see text] which satisfies [Formula: see text] satisfies one of the following: (1) [Formula: see text] is the identity function, (2) [Formula: see text] is the constant function with [Formula: see text], (3) [Formula: see text] for [Formula: see text] unless [Formula: see text] is odd and squareful. As a consequence, a multiplicative function which satisfies [Formula: see text] is the identity function.

Modeling the Dirichlet distribution using multiplicative functions

For q,m,n,d ∈ N and some multiplicative function f > 0, we denote by T3(n) the sum of f(d) over the ordered triples (q,m,d) with qmd = n. We prove that Cesaro mean of distribution functions defined by means of T3 uniformly converges to the one-parameter Dirichlet distribution function. The parameter of the limit distribution depends on the values of f on primes. The remainder term is estimated as well.

Petrović-Type Inequalities for Harmonic h-convex Functions

In the article, we establish several Petrović-type inequalities for the harmonic h-convex (concave) function if h is a submultiplicative (super-multiplicative) function, provide some new majorizaton type inequalities for harmonic convex function, and prove the superadditivity, subadditivity, linearity, and monotonicity properties for the functionals derived from the Petrović type inequalities.

MOMENTS OF RANDOM MULTIPLICATIVE FUNCTIONS, I: LOW MOMENTS, BETTER THAN SQUAREROOT CANCELLATION, AND CRITICAL MULTIPLICATIVE CHAOS

We determine the order of magnitude of $\mathbb{E}|\sum _{n\leqslant x}f(n)|^{2q}$ , where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0\leqslant q\leqslant 1$ . In the Steinhaus case, this is equivalent to determining the order of $\lim _{T\rightarrow \infty }\frac{1}{T}\int _{0}^{T}|\sum _{n\leqslant x}n^{-it}|^{2q}\,dt$ . In particular, we find that $\mathbb{E}|\sum _{n\leqslant x}f(n)|\asymp \sqrt{x}/(\log \log x)^{1/4}$ . This proves a conjecture of Helson that one should have better than squareroot cancellation in the first moment and disproves counter-conjectures of various other authors. We deduce some consequences for the distribution and large deviations of $\sum _{n\leqslant x}f(n)$ . The proofs develop a connection between $\mathbb{E}|\sum _{n\leqslant x}f(n)|^{2q}$ and the $q$ th moment of a critical, approximately Gaussian, multiplicative chaos and then establish the required estimates for that. We include some general introductory discussion about critical multiplicative chaos to help readers unfamiliar with that area.

NONNEGATIVE MULTIPLICATIVE FUNCTIONS ON SIFTED SETS, AND THE SQUARE ROOTS OF −1 MODULO SHIFTED PRIMES

An oft-cited result of Peter Shiu bounds the mean value of a nonnegative multiplicative function over a coprime arithmetic progression. We prove a variant where the arithmetic progression is replaced by a sifted set. As an application, we show that the normalized square roots of −1 (mod m) are equidistributed (mod 1) as m runs through the shifted primes q − 1.