Related papers: Autocorrelation of the Mobius Function

We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and…

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Elementary algebraic constraints on the form of an autocorrelation function C(tw+t,tw)=<A(tw+t)A(tw)> rule out some two-time scalings found in the literature as possible long-time asymptotic forms. The same argument leads to the realization…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

A function $\rho:[0,\infty)\to(0,1]$ is a completely monotonic function if and only if $\rho(\Vert\mathbf{x}\Vert^2)$ is positive definite on $\mathbb{R}^d$ for all $d$ and thus it represents the correlation function of a weakly stationary…

Let $d(n)$ be the divisor function and denote by $[t]$ the integral part of the real number $t$. In this paper, we prove that $$\sum_{n\leq x^{1/c}}d\left(\left[\frac{x}{n^c}\right]\right)=d_cx^{1/c}+\mathcal{O}_{\varepsilon,c}…

We study the double sum $S_\varepsilon(X)$$=$$\sum_{\substack{d,e\le X}}\frac{\mu(d)\mu(e)}{[d,e]^{1+\varepsilon}}$, which converges even in the case $\varepsilon=0$, where $\mu$ denotes the M\"obius function and $[d,e]$ is the least common…

A random coefficient autoregressive process is deeply investigated in which the coefficients are correlated. First we look at the existence of a strictly stationary causal solution, we give the second-order stationarity conditions and the…

We prove the following results: let x,y be (n,n) complex matrices such that x,y,xy have no eigenvalue in ]-infinity,0] and log(xy)=log(x)+log(y). If n=2, or if n>2 and x,y are simultaneously triangularizable, then x,y commute. In both cases…

We obtain an asymptotic formula for the L^1 norm of the exponential sum $M(\alpha) = \sum_{n\le X}\tau(n)e(n\alpha)$ where $\tau(n) = \sum_{d|n} 1$ is the divisor function. In particular, we show that it is $\sim C\sqrt{X}\log X$ with $C =…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

We study the problem of obtaining asymptotic formulas for the sums $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$ and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$, where $\Lambda$ is the von Mangoldt function, $d_k$ is the $k^{\operatorname{th}}$…

A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations,…

The constitutive quantities in Mori's theory, the residual forces, are expanded in terms of time dependent correlation functions and products of operators at $t=0$, where it is assumed that the time derivatives of the observables are given…

We introduce a class of multiplicative functions in which each function satisfies some statistic conditions, and then prove that above functions are not correlated with finite degree polynomial nilsequences. Besides, we give two…

Critical slowing down (CSD) is the phenomenon in which a system recovers more slowly from small perturbations. CSD, as evidenced by increasing signal variance and autocorrelation, has been observed in many dynamical systems approaching a…

The asymptotic study of class numbers of binary quadratic forms is a foundational problem in arithmetic statistics. Here, we investigate finer statistics of class numbers by studying their self-correlations under additive shifts.…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…