Related papers: Sieve weights and their smoothings
We provide an asymptotic estimate for certain sums over k-free integers with small prime factors. These sums depend upon a complex parameter \alpha and involve a smooth cut-off f. They are a variation of several classical number-theoretical…
The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…
In analytic number theory, several results make use of information regarding the prime values of a multiplicative function in order to extract information about its averages. Examples of such results include Wirsing's theorem and the…
We obtain new bounds for short sums of isotypic trace functions associated to some sheaf modulo prime $p$ of bounded conductor, twisted by the Mobius function and also by the generalised divisor function. These trace functions include…
In this note we investigate the behavior at the central point of the symmetric square $L$-functions, the most frequently used $\rm{GL}(3)$ $L$-functions. We establish an asymptotic formula with arbitrary power saving for the first moment of…
In this paper, we improve the moment estimates for the gaps between numbers that can be represented as a sum of two squares of integers. We consider certain sum of Bessel functions and prove the upper bound for its weighted mean value. This…
We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…
Let $f$ be a real polynomial with irrational leading co-efficient. In this article, we derive distribution of $f(n)$ modulo one for all $n$ with at least three divisors and also we study distribution of $f(n)$ for all square-free $n$ with…
Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2 + it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x) = -…
We obtain a first non-trivial estimate for the sum of dilates problem in the case of groups of prime order, by showing that if $t$ is an integer different from $0, 1$ or -1 and if $\A \subset \Zp$ is not too large (with respect to $p$),…
We show that the M\"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this…
We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…
We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations…
Let $\mu$ be a probability measure (or corresponding random variable) such that all moments $\mu_n$ exist. Knowledge of the moments is not sufficient to determine infinite divisibility of the measure; we show also that infinitely divisible,…
In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…
Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,\chi)$ of moduli $q$ and primitive…
Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…