Related papers: Dependencies of prime numbers in a tuple
We present an extension of the Hardy--Littlewood inequality for multilinear forms. More precisely, let $\mathbb{K}$ be the real or complex scalar field and $m,k$ be positive integers with $m\geq k\,$ and $n_{1},\dots ,n_{k}$ be positive…
We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…
The Hardy-Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are stated for $p>m$. In this paper, among other results, we investigate similar results for $1\leq p\leq m.$ Let $\mathbb{K}$ be $% \mathbb{R}$ or $\mathbb{C}$ and…
Recently we have introduced a novel characterisation of the distribution of twin primes that consists of three essential elements. These are: that the twins are most naturally viewed as a subsequence of the primes themselves, that the…
Let $D_{k}$ be a set with $k$ distinct elements of integers such that $d_{1}<d_{2}<\cdots<d_{k}$. We say $D_{k}^{*}$ is a $k$-tuple prime difference champion ($k$-tuple PDC) for primes $\le x$ if the set $D_{k}^{*}$ is the most probable…
In this paper we study the Mixed Littlewood Conjecture with pseudo-absolute values. We show that if p is a prime and D is a pseudo-absolute value sequence satisfying mild conditions then then the infimum over natural numbers n of the…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is…
Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
We give heuristic arguments and computer results to support the hypothesis that, after appropriate rescaling, the statistics of spacings between adjacent prime numbers follows the Poisson distribution. The scaling transformation removes the…
For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…
The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We…
Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…
The Hardy Inequality (HI) for potentials with countably many singularities of the form $V=\sum_{k\in \mathbf{Z}}\frac{1}{|x-a_k|^2}$ is not a trivial issue. In principle, the more singular poles are, the less the Hardy constant is: it is…
We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…
Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary…
We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…
The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…
The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions. It is shown that the values at zero of the concentration…