Related papers: On Bombieri's asymptotic sieve

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

I study the product of independent identically distributed $D\times D$ random probability matrices. Some exact asymptotic results are obtained. I find that both the left and the right products approach exponentially to a probability…

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

Several asymptotic expansions and formulas for cubic exponential sums are derived. The expansions are most useful when the cubic coefficient is in a restricted range. This generalizes previous results in the quadratic case and helps to…

We discuss in detail the asymptotic distribution of sample expectiles. First, we show uniform consistency under the assumption of a finite mean. In case of a finite second moment, we show that for expectiles other then the mean, only the…

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

An asymptotic series in Ramanujan's second notebook (Entry 10, Chapter 3) is concerned with the behavior of the expected value of $\phi(X)$ for large $\lambda$ where $X$ is a Poisson random variable with mean $\lambda$ and $\phi$ is a…

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…

This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper…

We consider the asymptotic expansion of the functional series \[S_{\mu}^\pm(a;\lambda)=\sum_{n=0}^\infty \frac{(\pm 1)^n e^{-\lambda n}}{(n^2+a^2)^\mu}\] for $\lambda>0$ and $\mu\geq0$ as $|a|\to \infty$ in the sector $|\arg\,a|<\pi/2$. The…

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$…

The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…

The binary problem of Goldbach is solved by the method of the trigonometrical sums. The asymptotic formula of distribution of the even numbers formed by the sum of two simple uneven numbers is found for each even number from the set of…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

We obtain asymptotics with a power saving error term for $\int_0^1|\sum_{n\le X} d(n)e(n\alpha)|^sd\alpha$ for $s < 2$, where $d(n) = \sum_{d | n} 1$ is the divisor function. We also obtain such asymptotics for $\int_0^1|\sum_{n\le…

I present an asymptotic formula for the Takeuchi numbers $T_n$. In particular, I give compelling numerical evidence and present a heuristic argument showing that $$T_n\sim C_T B_n\exp{1\over2}{W(n)}^2$$as $n$ tends to infinity, where $B_n$…

A positive integer $n$ is said to be a palindrome in base $b$ (or $b$-adic palindrome) if the representation of $n = (a_k a_{k-1} \cdots a_0)_b$ in base $b$ with $a_k \neq 0$ has the symmetric property $a_{k-i} = a_i$ for every…