Related papers: Gaps between Primes in Beatty Sequences
This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…
The distribution of differences of consecutive members of sequences of primes is investigated. A quantitative measure for oscillations among these differences is the curvature of the sequence. If the sequence is not too sparse, then sharp…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…
The computer data up to $2^{44}\approx 1.76\times 10^{13}$ on the gaps between consecutive twins is presented. The simple derivation of the heuristic formula describing computer results contained in the recent papers by P.F.Kelly and…
We propose a method for filling arbitrarily wide gaps in deterministic time series. Crucial to the method is the ability to apply Takens' theorem in order to reconstruct the dynamics underlying the time series. We introduce a functional to…
In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…
We examine the mixing time for random walks on graphs. In particular we are interested on investigating graphs with bottlenecks. Furthermore, the cutoff phenomenon is examined.
Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).
We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…
The availability of large amounts of time series data, paired with the performance of deep-learning algorithms on a broad class of problems, has recently led to significant interest in the use of sequence-to-sequence models for time series…
This paper investigates interval estimation for a measurand that is known to be positive. Both the Neyman and Bayesian procedures are considered and the difference between the two, not always perceived, is discussed in detail. A solution is…
In this paper, we use Betti splittings of binomial edge ideals to establish improved upper and lower bounds for their regularity in the case of trees. As a consequence, we determine the exact regularity for certain classes of trees.
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…
We give a simple and straightforward proof of the Gap Theorem for separated sequences by A. Poltoratski and M. Mitkovski using the Beurling--Malliavin formula for the radius of completeness.
James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
We study the length of the gaps between consecutive members in the sumset sA when A is a pseudo s-th power sequence, with s>1. We show that, almost surely, limsup (b_{n+1}-b_{n})/log (b_n) = s^s s!/\Gamma^s(1/s), where b_n are the elements…
We prove a modification as well as an improvement of a result of K. Ford, D. R. Heath-Brown and S. Konyagin concerning prime avoidance of square-free numbers and perfect powers of prime numbers.