Related papers: Multiplicative functions supported on the $k$-free…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

Let $\kl_n(a,b;m)$ be the hyper-Kloosterman sum. Fix integers $n\geqslant2,a\neq0$, $b\neq0$ and $k\geqslant2$. For any $0\neq\eta\in\mathbb{C}$ and multiplicative function $f: \mathbb{N} \rightarrow \mathbb{C}$, we prove that…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

Let v be a multiplicative arithmetic function with support of positive asymptotic density. We prove that for any not identically zero arithmetic function f such that \sum_{f(n) \neq 0} 1 / n < \infty, the support of the Dirichlet…

We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We…

This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…

We derive a formula for the moments and the free cumulants of the multiplication of $k$ free random variables in terms of $k$-equal and $k$-divisible non-crossing partitions. This leads to a new simple proof for the bounds of the right-edge…

In two papers entitled ``Two generalizations of almost perfect nonlinearity" and ``On the vector subspaces of $\mathbb F_{2^n}$ over which the multiplicative inverse function sums to zero", the first author has introduced and studied the…

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

We prove multiplier theorems on rank one noncompact symmetric spaces which improve aspects of existing results. A common theme of our main results is that we partially drop specific assumptions on the multiplier function such as a…

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Let $k$ be an integer greater than or equal $4$. We show that if a multiplicative function $f$ satisfies \[ f(x_1^2 + x_2^2 + \dots + x_k^2) = f(x_1)^2 + f(x_2)^2 + \dots + f(x_k)^2 \] for all positive integers $x_i$'s, then $f$ is the…

Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.