Related papers: Generalising the Hardy-Littlewood Method for Prime…
This paper describes a practical methodology for computing the Hardy function Z(t), using just O(((t/epsilon)^(1/3))*(log(t))^(2+o(1)))) standard computational operations, to a tolerance of epsilon in the relative error. The methodology is…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
Exploiting the equidistribution properties of polynomial sequences, following the methods developed by Leibman ("Pointwise Convergence of ergodic averages for polynomial sequences of translations on a nilmanifold. Ergodic Theory Dynam.…
In the early 1920s, Hardy and Littlewood considered the number of integer points in the right-angled triangles with irrational inclines of the diagonal. We extend their results to higher dimensions.
TO BE PUBLISHED BY ISRAEL JOURNAL OF MATHEMATICS. We study the mean $\sum_{x\in\mathcal{X}} \bigl|\sum_{p\le N}{}u_p e(xp)\bigr|^{\ell}$ when $\ell$ covers the full range $[2,\infty)$ and $\mathcal{X}\subset\mathbb{R}/\mathbb{Z}$ is a…
B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…
We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates. We discuss…
The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…
We prove that the boundary of the Hall-Littlewood $t$-deformation of the Gelfand-Tsetlin graph is parametrized by infinite integer signatures, extending results of Gorin and Cuenca on boundaries of related deformed Gelfand-Tsetlin graphs.…
Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…
Newell-Littlewood coefficients $n_{\mu,\nu}^{\lambda}$ are the multiplicities occurring in the decomposition of products of universal characters of the orthogonal and symplectic groups. They may also be expressed, or even defined directly…
For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…
In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…
The Hardy--Littlewood inequality for complex homogeneous polynomials asserts that given positive integers $m\geq2$ and $n\geq1$, if $P$ is a complex homogeneous polynomial of degree $m$ on $\ell_{p}^{n}$ with $2m\leq p\leq\infty$ given by…
In this paper we prove that there is a continuum set of increments with some minimal structure for the Hardy - Littlewood integral. The result implies a number of new properties of the Hardy - Littlewood integral.
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
We prove a generalized Hardy-Littlewood lemma on a non-smooth domain in "$f$-norm" and give an application to a corresponding estimate for the $\dib$-Neumann problem by means of suitable weights.