相关论文: Linear Equations in Primes

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Studying two point branched Galois covers of the projective line we prove the Inertia Conjecture for the Alternating groups $A_{p+1}$, $A_{p+3}$, $A_{p+4}$ for any odd prime $p \equiv 2 \pmod{3}$ and for the group $A_{p+5}$ when…

In this paper, we consider a version of the bias conjecture for second moments in the setting of elliptic curves over finite fields whose trace of Frobenius lies in an arbitrary fixed arithmetic progression. Contrary to the classical…

We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…

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…

Let $N$ denote a sufficiently large even integer and $x$ denote a sufficiently large integer, we define $D_{1,2}(N)$ as the number of primes $p$ that such that $N - p$ has at most 2 prime factors. In this paper, we show that $D_{1,2}(N)…

This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…

Let $E/\mathbb{Q}$ an elliptic curve with good supersingular reduction at a prime $p\geq 5$, and $K$ an imaginary quadratic field such that the root number of $E$ over $K$ equals $-1$. When $p$ splits in $K$, Castella and Wan formulated the…

The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that even among the idempotent polynomials there must exist…

We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally, given a prime pp p, no general algorithm can compute 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…