𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improvement for the large sieve for square moduli

✍ Scribed by Stephan Baier; Liangyi Zhao


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
184 KB
Volume
128
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis


We establish a result on the large sieve with square moduli. These bounds improve recent results by S.


📜 SIMILAR VOLUMES


Applications of the Large Sieve Inequali
✍ Chih-Nung Hsu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The purpose of this note is the following: (1) To get an upper bound for the number of monic irreducible polynomials in % O [¹ ] obtained by changing coefficients of a polynomial in lower degree terms. (2) To generalize the Titchmarsh Linnik divisor problem to polynomial ring % O [¹ ] and prove an a

Improved parallel QR method for large le
✍ Donald W. Fausett; Charles T. Fulton; Hany Hashish 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 894 KB

A new algorithm is presented for the efficient solution of large least squares problems in which the coefficient matrix of the linear system is a Kronecker product of two smaller dimension matrices. The solution algorithm is based on QR factorizations of the smaller dimension matrices. Near perfect

An improved approximation algorithm for
✍ Carla P. Gomes; Rommel G. Regis; David B. Shmoys 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa

On the Sieve Parametersακandβκfor Largeκ
✍ Harold G Diamond; H Halberstam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

dedicated to the memory of our friend, paul erdo s Two 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 A