Related papers: Mertens's theorem for splitting primes and more
We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…
Effective field theories endowed with a nontrivial moduli space may be broken down by several, distinct effects as the energy scales that are probed increase. These may include the appearance of a finite number of new states, or the…
We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…
We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…
The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…
In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…
This is an article for a general mathematical audience on the author's work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. It is based on several one hour lectures, chiefly given at…
In our effort to find an arithmetically pure proof of the Bertrand postulate, we investigate and solve (using only elementary arithmetical methods) another less usual inequality in positive integers inspired by the classical proof of the…
We formulate and prove an analogue of Beurling's theorem for the Fourier transform on the Heisenberg group. As a consequence we deduce Hardy and Cowling-Price theorems.
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
The article studies the convergence of trigonometric Fourier series via a new Tauberian theorem for Ces\`{a}ro summable series in abstract normed spaces. This theorem generalizes some known results of Hardy and Littlewood for number series.…
Slattery has generalized Brauer's theory of p-blocks of finite groups to pi-blocks of pi-separable groups where pi is a set of primes. In this setting we show that the order of a defect group of a pi-block B is bounded in terms of the…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Littlewood's theorem is one of the pioneering results in random analytic functions over the open unit disk. In this paper, we prove some analogues of this theorem for Hardy spaces in infinitely many variables. Our results not only cover…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
In this paper we derive congruences expressing Bell numbers and derangement numbers in terms of each other modulo any prime.
For an abelian category and a distinguished object with a graded endomorphism ring a necessary and sufficient criterion is given so that the category is equivalent to the abelian quotient of the category of finitely presented graded modules…
The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…
We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…
In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.