AbstractTwo parameters,ακandβκ, play a central role in the sieve method of Diamond, Halberstam, and Richert. For each value of the sieve dimensionκ>1,ακis the point beyond which the DHR upper sieve improves upon the upper bound sieve function of Ankeny and Onishi; and the sieving limitβκis the point beyond which the DHR lower sieve yields a nontrivial (i.e., positive) lower bound. We show that for all large enoughκ,ακlies within a bounded distance ofρκ, the largest positive zero of Iwaniec's functionqκ(·) and thatβκis smaller thanνκ, the sieving limit of the Ankeny–Onishi sieve
AbstractA general sieve for each dimension κ > 1 is given which improves the sieve estimates of Anke...
The large sieve method has been used extensively, beginning with Bombieri in 1965, to provide bounds...
The purpose of these notes is to present a proof of the large sieve in several variables. Gallagher ...
AbstractTwo parameters,ακandβκ, play a central role in the sieve method of Diamond, Halberstam, and ...
Abstract. Sifting limits for the Λ2Λ − sieve, Selberg’s lower bound sieve, are computed for integral...
A sieve is a device for estimating the size of a finite set of integers after certain residue classe...
In this paper, we present an improvement of a large sieve type inequality in high dimensions and dis...
We establish a result on the large sieve with square moduli. These bounds improve recent results by ...
We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take ...
This thesis focuses on refinements of Selberg's sieve as well as new applications of the sieve. Sie...
This book surveys the current state of the "small" sieve methods developed by Brun, Selberg and late...
In this note, the maximal Large Sieve inequality has been used to obtain following estimate: where D...
This paper contains two remarks concerning the large sieve inequality, which are partly related to a...
On an almost pure sieve by C. Hooley (Cardiff) Combinatorial sieve methods can be classified accordi...
AbstractLet A denote a finite sequence of integers and put Ad = {a ∈ A : a ≡ 0(d)}. Let P denote a s...
AbstractA general sieve for each dimension κ > 1 is given which improves the sieve estimates of Anke...
The large sieve method has been used extensively, beginning with Bombieri in 1965, to provide bounds...
The purpose of these notes is to present a proof of the large sieve in several variables. Gallagher ...
AbstractTwo parameters,ακandβκ, play a central role in the sieve method of Diamond, Halberstam, and ...
Abstract. Sifting limits for the Λ2Λ − sieve, Selberg’s lower bound sieve, are computed for integral...
A sieve is a device for estimating the size of a finite set of integers after certain residue classe...
In this paper, we present an improvement of a large sieve type inequality in high dimensions and dis...
We establish a result on the large sieve with square moduli. These bounds improve recent results by ...
We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take ...
This thesis focuses on refinements of Selberg's sieve as well as new applications of the sieve. Sie...
This book surveys the current state of the "small" sieve methods developed by Brun, Selberg and late...
In this note, the maximal Large Sieve inequality has been used to obtain following estimate: where D...
This paper contains two remarks concerning the large sieve inequality, which are partly related to a...
On an almost pure sieve by C. Hooley (Cardiff) Combinatorial sieve methods can be classified accordi...
AbstractLet A denote a finite sequence of integers and put Ad = {a ∈ A : a ≡ 0(d)}. Let P denote a s...
AbstractA general sieve for each dimension κ > 1 is given which improves the sieve estimates of Anke...
The large sieve method has been used extensively, beginning with Bombieri in 1965, to provide bounds...
The purpose of these notes is to present a proof of the large sieve in several variables. Gallagher ...