The original criteria of Riesz and of Hardy-Littlewood concerning the truth of the Riemann Hypothesis (RH) are revisited and further investigated in light of the recent formulations and results of Maslanka and of Baez-Duarte concerning a representation of the Riemann Zeta function. Then we introduce a general set of similar functions with the emergence of Poisson-like distributions and we present some numerical experiments which indicate that the RH may barely be true.
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
In the article we establish the Hardy-Littlewood inequality $ π(x + y) \leq π(x) + π(y) $. We also prove that the naturally ordered primes $p_1=2,p_2=3,p_3=5,p_4=7,\dots$ satisfy the inequality $ p_ {a + b}> p_a + p_b $ for all $a, \ b \geq 2$.
The essential aim of this paper is to define weighted q-Hardy-littlewood-type maximal operator by means of p-adic q-invariant distribution on Zp. Moreover, we give some interesting properties concerning this type maximal operator.
Jacob's ladders, logarithmic modification of the Hardy-Littlewood integral (1918), Titchmarsh's $Ω$-theorem (1928) and new point of contact with the Fermat-Wiles theorem
In the present paper, we prove that the generalized Riemann hypothesis for the Dirichlet $L$-function $L(s,χ)$ is equivalent to the following bound: Let $k \geq 1$ and $\ell$ be positive real numbers. For any $ε>0$, we have \begin{align*} \sum_{n=1}^{\infty} \frac{χ(n) μ(n)}{n^{k}} \exp \left(- \frac{ x}{n^{\ell}}\right) = O_{ε,k,\ell} \bigg(x^{-\frac{k}{\ell}+\frac{1}{2 \ell} + ε}\bigg), \quad \mathrm{as}\,\, x \rightarrow \infty, \end{align*} where $χ$ is a primitive Dirichlet character modulo $q$, and $μ(n)$ denotes the Möbius function. This bound generalizes the previous bounds given by Ri…
Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on new explicit estimates for the prime counting function $π(x)$, we give some new ranges in which this conjecture holds.
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the number of 3-term progressions of primes, all less than N. This article surveys recent developments of the author and T. Tao, in which the Hardy-Littlewood method has been generalised to obtain, for example, an asymptotic for the number of 4-term arithmetic progressions of primes less than N.
The fundamental aim of this paper is to define weighted q-Hardy-littlewood-type maximal operator by means of fermionic p-adic q-invariant distribution on Zp . Also, we derive some interesting properties concerning this type maximal operator.
We study the asymptotic behaviour of the prime pair counting function $π_{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method. We discuss some advantages this has over the Fourier series on $\mathbb{R} /\mathbb{Z}$, which is used in the circle method. We show how to recover the main term for $π_{2k}(n)$ predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on $\mathbb{Z}/ n\mathbb{Z}$ and o…
In this article, we investigate the bound of the valency of the Cayley graphs of the generalized quaternion groups which guarantees to be Ramanujan. As is the cases of the cyclic and dihedral groups in our previous studies, we show that the determination of the bound in a special setting is related to the classical Hardy-Littlewood conjecture for primes represented by a quadratic polynomial.
It was recently proved that for $p>2m^{3}-4m^{2}+2m$ the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$-spaces are less than or equal to the best known estimates of respective constants of the Bohnenblust--Hille inequality. In this note we obtain upper bounds for opposite side, i.e., the constants when $2m\leq p\leq2m^{3}-4m^{2}+2m.$ For these values of $p$ our result improves previous estimates from 2014 of Araujo \textit{et al}. for all $m\geq3.$
A group of infinite products over low-order rational polynomials evaluated at the sequence of prime numbers is loosely called the Hardy-Littlewood constants. In this manuscript we look at them as factors embedded in a super-product over primes, semiprimes, 3-almost primes etc. Numerical tables are derived by transformation into series over k-almost prime zeta functions. Alternative product representations in a basis of k-almost prime products associated with Euler's formula for the Riemann zeta function are also pointed out.
Jacob's ladders, almost linear increments of the Hardy-Littlewood integral (1918) and their relation to the Titchmarsh's sums (1943) and the Fermat-Wiles theorem
In this note we study the growth of \sum_{m=1}^M\frac1{\|mα\|} as a function of M for different classes of α\in[0,1). Hardy and Littlewood showed that for numbers of bounded type, the sum is \simeq M\log M. We give a very simple proof for it. Further we show the following for generic α. For a non-decreasing function ϕtending to infinity, \limsup_{M\to\infty}\frac1{ϕ(\log M)}\bigg[\frac1{M\log M}\sum_{m=1}^M\frac1{\|mα\|}\bigg] is zero or infinity according as \sum\frac1{kϕ(k)} converges or diverges.
The second Hardy-Littlewood conjecture, that $π(x)+π(y) \geq π(x+y)$ for integers $x$ and $y$ with $\min\{x,y\}\geq 2$, was formulated in 1923. It continues to attract attention to this day, almost 100 years later. In 1975 Udrescu proved that this conjecture holds for $(x,y)$ sufficiently large, but without an explicit effective bound on the region of validity. We shall revisit Udrescu's result, modifying it to obtain explicit effective bounds, ultimately proving that the second Hardy-Littlewood conjecture is in fact unconditionally true. Furthermore we note that constraints on the prime count…
We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the $2d$ different primes. We may conclude that there exist infinitely many $2d$ different primes including the twin primes in case of $d=1$ because we can give the lower bounds of the existence density for the $2d$ different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
In 1916, Riesz proved that the Riemann hypothesis is equivalent to the bound $\sum_{n=1}^\infty \frac{μ(n)}{n^2} \exp\left( - \frac{x}{n^2} \right) = O_ε \left( x^{-\frac{3}{4} + ε} \right)$, as $x \rightarrow\infty$, for any $ε>0$. Around the same time, Hardy and Littlewood gave another equivalent criteria for the Riemann hypothesis while correcting an identity of Ramanujan. In the present paper, we establish a one-variable generalization of the identity of Hardy and Littlewood and as an application, we provide Riesz-type criteria for the Riemann hypothesis. In particular, we obtain the bound…
Schinzel's Hypothesis (H) was used by Colliot-Thélène and Sansuc, and later by Serre, Swinnerton-Dyer and others, to prove that the Brauer-Manin obstruction controls the Hasse principle and weak approximation on pencils of conics and similar varieties. We show that when the ground field is Q and the degenerate geometric fibres of the pencil are all defined over Q, one can use these methods to obtain unconditional results by replacing Hypothesis (H) with the finite complexity case of the generalised Hardy-Littlewood conjecture recently established by Green, Tao and Ziegler.
Jacob's ladders, Hardy-Littlewood integral (1918) and new asymptotic functional equations for Euler's Gamma function together with the tenth equivalent of the Fermat-Wiles theorem
Jacob's ladders, almost exact decomposition of certain increments of the Hardy-Littlewood integral (1918) by means of the Raabe's integral and the thirteenth equivalent of the Fermat-Wiles theorem
We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many non-trivial three-term arithmetic progressions. We also prove that the Hardy--Littlewood majorant property holds for these subsets of primes. Notably, our considerations recover the results for the Piatetski--Shapiro primes for exponents close to $1$, which are primes of the form $\lfloor n^c\rfloor$ for a fixed $c>1$.
We establish the Hardy-Littlewood property (à la Borovoi-Rudnick) for Zariski open subsets in affine quadrics of the form $q(x_1,\cdots,x_n)=m$, where $q$ is a non-degenerate integral quadratic form in $n\geqslant 3$ variables and $m$ is a non-zero integer. This gives asymptotic formulas for the density of integral points taking coprime polynomial values, which is a quantitative version of the arithmetic purity of strong approximation property off infinity for affine quadrics.
Jacob's ladders, almost linear increments of the Hardy-Littlewood integral (1918) and their relations to the Selberg's formula (1946) and the Fermat-Wiles theorem
