Related papers: Short intervals asymptotic formulae for binary pro…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…

Using estimates on Hooley's $\Delta$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also…

The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…

For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a…

In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Let ${\Bbb Z}_{m}$ be the additive group of residue classes modulo $m$ and $s(m_{1},m_{2})$ denote the number of subgroups of the group ${\Bbb Z}_{m_{1}}\times {\Bbb Z}_{m_{2}}$, where $m_{1}$ and $m_{2}$ are arbitrary positive integers. We…

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

In [18] we have shown that, for $p_{1},p_{2}\in(2,\infty]$, the constants of Bennett's inequality on unimodular bilinear forms on $\ell_{p_{1}}^{n_{1} }\times\ell_{p_{2}}^{n_{2}}$ are asymptotically bounded by $1$. In the present paper we…

We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let $N_m^*(k,b)$ be the number of $k$-subsets $S\subseteq F_p^*$ such that $\sum_{x\in S}x^m=b$. If $m<p^{1-\delta}$, then there is a constant…

We obtain asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of the elliptic curve $$ \E_{a,b} : Y^2 = X^3 + aX + b $$ satisfies certain ``natural'' properties, on average over integers $a$ and $b$ with…

Let $p_n$ is the $n$-th prime. With help of the Cram\'er-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such…

We study the computational complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of…

A collection of finite sets $\{A_1, A_2,\ldots, A_{p}\}$ is said to be a double-covering if each $a\in \cup_{k=1}^{p}A_k$ is included in exactly two sets of the collection. For fixed integers $l$ and $p$, let $\mu_{l,p}$ be the number of…

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…