Related papers: Sparse sets that satisfy the prime number theorem

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

Erd\H{o}s and Graham asked whether any sparse enough admissible set of natural numbers can be translated into a subset of the primes. By using a greedy construction involving powers of primitive roots, we prove that there exist arbitrarily…

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

Motivated by the orthogonal series density estimation in $L^2([0,1],\mu)$, in this project we consider a new class of functions that we call the approximate sparsity class. This new class is characterized by the rate of decay of the…

In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

Let $\mathcal{P}$ denote the set of all primes, and let $\underline\delta(P)$ denote the relative lower density of a subset $P$ in $\mathcal{P}$. Suppose that $P_1, P_2, P_3, P_4$ are four subsets of primes with…

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

We construct a classifier which attains the rate of convergence $\log n/n$ under sparsity and margin assumptions. An approach close to the one met in approximation theory for the estimation of function is used to obtain this result. The…

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…