相关论文: On correlation of the 3-fold divisor function with…

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

Applying functional differentiation to the density field with Newtonian gravity, we obtain the static, nonlinear equation of the three-point correlation function $\zeta$ of galaxies, to the third order density perturbations. We make the…

We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}\tau\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a…

Let $X$ be an arbitrary continuous random variable and $Z$ be an independent Gaussian random variable with zero mean and unit variance. For $t~>~0$, Costa proved that $e^{2h(X+\sqrt{t}Z)}$ is concave in $t$, where the proof hinged on the…

In this short note, we treat an unbalanced shifted convolution sum of Fourier coefficients of cusp forms by a rather simple argument. Our result improves previous results established by more advanced approaches.

We compute the $n_h$ terms to the massive three loop vector-, axialvector-, scalar- and pseudoscalar form factors in a direct analytic calculation using the method of large moments. This method has the advantage, that the master integrals…

Hardy and Littlewood initiated the study of the $2k$-th moments of the Riemann zeta function on the critical line. In 1918 Hardy and Littlewood established an asymptotic formula for the second moment and in 1926 Ingham established an…

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 present a different proof of the following identity due to Munarini, which generalizes a curious binomial identity of Simons. \begin{align*} \sum_{k=0}^{n}\binom{\alpha}{n-k}\binom{\beta+k}{k}x^k…

For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to…

In this paper, we obtain bounds on the $L^1$ norm of the sum $\sum_{n\le x}\tau(n) e(\alpha n)$ where $\tau(n)$ is the divisor function.

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over…

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

One of the main goals in this paper is to establish convolution sums of functions for the divisor sums $\widetilde{\sigma}_s(n)=\sum_{d|n}(-1)^{d-1}d^s$ and $\widehat{\sigma}_s(n)=\sum_{d|n}(-1)^{\frac{n}{d}-1}d^s$, for certain $s$, which…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

We discuss a correlation function factorization, which relates a three-point function to the square root of three two-point functions. This factorization is known to hold for certain scaling operators at the two-dimensional percolation…

Let $\tau(n)$ be the number of divisors of $n$. We give an elementary proof of the fact that $$ \sum_{n\le x} \tau(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}), $$ for any integer $r\ge 2$. Here, $$ C_{r}=\frac{1}{(2^r-1)!}…