Results 1 
9 of
9
Approximating Good Simultaneous Diophantine Approximations is almost NPhard
, 1996
"... . Given a real vector ff=(ff1 ; : : : ; ff d ) and a real number " ? 0 a good Diophantine approximation to ff is a number Q such that kQff mod Zk1 ", where k \Delta k1 denotes the `1norm kxk1 := max 1id jx i j for x = (x1 ; : : : ; xd ). Lagarias [12] proved the NPcompleteness of the correspond ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. Given a real vector ff=(ff1 ; : : : ; ff d ) and a real number " ? 0 a good Diophantine approximation to ff is a number Q such that kQff mod Zk1 ", where k \Delta k1 denotes the `1norm kxk1 := max 1id jx i j for x = (x1 ; : : : ; xd ). Lagarias [12] proved the NPcompleteness of the corresponding decision problem, i.e., given a vector ff 2 Q d , a rational number " ? 0 and a number N 2 N+ , decide whether there exists a number Q with 1 Q N and kQff mod Zk1 ". We prove that, unless NP ` DTIME(n poly(log n) ), there exists no polynomial time algorithm which computes on inputs ff 2 Q d and N 2 N+ a number Q with 1 Q 2 log 0:5\Gammafl d N and kQ ff mod Zk1 2 log 0:5\Gammafl d min 1qN jjqff mod Zk1 ; where fl is an arbitrary small positive constant. To put it in other words, it is almost NPhard to approximate a minimum good Diophantine approximation to ff in polynomialtime within a factor 2 log 0:5\Gammafl d for an arbitrary small positive const...
The difference between consecutive primes ii
 London Math. Soc
, 2001
"... Beginning with Hoheisel [8], many authors have found shorter and shorter intervals ‰x � x v; xŠ that must contain a prime number. The most recent result is v ˆ 0:535: see Baker and Harman [1], where the history of the problem is ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Beginning with Hoheisel [8], many authors have found shorter and shorter intervals ‰x � x v; xŠ that must contain a prime number. The most recent result is v ˆ 0:535: see Baker and Harman [1], where the history of the problem is
The Distribution Of Prime Ideals Of Imaginary Quadratic Fields
"... Let Q(x; y) be a primitive positive de nite quadratic form with integer coecients. Then, for all (s; t) 2 R 2 there exist (m; n) 2 Z 2 such that Q(m;n) is prime and Q(m s; n t) Q(s; t) 0:53 : This is deduced from another result giving an estimate for the number of prime ideals in an ideal class of a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let Q(x; y) be a primitive positive de nite quadratic form with integer coecients. Then, for all (s; t) 2 R 2 there exist (m; n) 2 Z 2 such that Q(m;n) is prime and Q(m s; n t) Q(s; t) 0:53 : This is deduced from another result giving an estimate for the number of prime ideals in an ideal class of an imaginary quadratic number field that fall in a given sector and whose norm lies in a short interval.
THE POSTAGE STAMP PROBLEM AND ESSENTIAL SUBSETS IN INTEGER BASES
, 2008
"... ABSTRACT. Plagne recently determined the asymptotic behavior of the function E(h), which counts the maximum possible number of essential elements in an additive basis for N of order h. Here we extend his investigations by studying asymptotic behavior of the function E(h, k), which counts the maximum ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT. Plagne recently determined the asymptotic behavior of the function E(h), which counts the maximum possible number of essential elements in an additive basis for N of order h. Here we extend his investigations by studying asymptotic behavior of the function E(h, k), which counts the maximum possible number of essential subsets of size k, in a basis ( of order h. For a fixed k and with h going to infinity, we show that k 1/(k+1) E(h, k) = Θk [h / log h] ). The determination of a more precise asymptotic formula is shown to depend on the solution of the wellknown ‘postage stamp problem’ in finite cyclic groups. On the other hand, with h fixed and k going to infinity, we show log k that E(h, k) ∼ (h − 1) log log k. 1. ESSENTIAL SUBSETS OF INTEGER BASES Let S be a countable abelian semigroup, written additively, h be a positive integer and A ⊆ S. The hfold sumset hA consists of all s ∈ S which can be expressed as
Primes in almost all short intervals and the distribution of the zeros of the Riemann zetafunction
"... We study the relations between the distribution of the zeros of the Riemann zetafunction and the distribution of primes in "almost all" short intervals. It is well known that a relation like #(x)#(xy) holds for almost all x [N, 2N ] in a range for y that depends on the width of the available ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the relations between the distribution of the zeros of the Riemann zetafunction and the distribution of primes in "almost all" short intervals. It is well known that a relation like #(x)#(xy) holds for almost all x [N, 2N ] in a range for y that depends on the width of the available zerofree regions for the Riemann zetafunction, and also on the strength of density bounds for the zeros themselves. We also study implications in the opposite direction: assuming that an asymptotic formula like the above is valid for almost all x in a given range of values for y, we find zerofree regions or density bounds.
Sieve Methods
"... Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after th ..."
Abstract
 Add to MetaCart
Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after the pioneering work of Viggo Brun (see [Bru16],[Bru19], [Bru22]). Using his formulation of the sieve Brun proved, that the sum
Preface Lectures on sieves
, 2002
"... These are notes of a series of lectures on sieves, presented during the Special ..."
Abstract
 Add to MetaCart
These are notes of a series of lectures on sieves, presented during the Special
doi:10.1017/S0017089509990176. DIOPHANTINE APPROXIMATION BY PRIMES
, 2009
"... Abstract. We show that whenever δ>0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality λ0 + λ1p1 + λ2p2 + λ3p3  < (max pj) −2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector s ..."
Abstract
 Add to MetaCart
Abstract. We show that whenever δ>0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality λ0 + λ1p1 + λ2p2 + λ3p3  < (max pj) −2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.