Related papers: Sieve weights and their smoothings

We establish asymptotic normality of weighted sums of periodograms of a stationary linear process where weights depend on the sample size. Such sums appear in numerous statistical applications and can be regarded as a discretized versions…

The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

We study the asymptotics of the moments of arithmetic functions that have a limit distribution, not necessarily normal, defined on a subset of the natural series that satisfies certain requirements. Several assertions are proved on…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

We study the $2k$-th moment of central values of the family of Dirichlet $L$-functions to a fixed prime modulus. We establish sharp lower bounds for all real $k \geq 0$ and sharp upper bounds for $k$ in the range $0 \leq k \leq 1$.

Let $f(z)=q+\sum_{n\geq 2}a(n)q^n$ be a weight $k$ normalized newform with integer coefficients and trivial residual mod 2 Galois representation. We extend the results of Amir and Hong in \cite{AH} for $k=2$ by ruling out or locating all…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

We consider the asymptotic behavior of the mean square of truncations of the Dirichlet series of $\zeta(s)^k$. We discuss the connections of this problem with that of the variance of the divisor function in short intervals and in arithmetic…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

Empirical researchers often trim observations with small denominator A when they estimate moments of the form E[B/A]. Large trimming is a common practice to mitigate variance, but it incurs large trimming bias. This paper provides a novel…

The main objectives of this paper are to give general proofs of the following two facts: A. For an operad $\oo$ in $\ab$, let $A$ be a simplicial $\oo$-algebra such that $A_m$ is the $\oo$-subalgebra generated by $(\sum_{i = 0}^{m}…

Shrinkage of large particles, either through depolymerisation (i.e. progressive shortening) or through fragmentation (breakage into smaller pieces) may be modelled by discrete equations, of Becker-D\''oring type, or by continuous ones. In…

Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…