Large Sieve Inequality with Quadratic Amplitudes

In this paper, we develop a large sieve type inequality with quadratic amplitude. We use the double large sieve to establish non-trivial bounds.     

An improvement for the large sieve for square moduli

We establish a result on the large sieve with square moduli. These bounds improve recent results by S. Baier [S. Baier, On the large sieve with sparse sets of moduli, J. Ramanujan Math. Soc. 21 (2006) 279-295] and L. Zhao [L. Zhao, Large sieve inequality for characters to square moduli, Acta Arith. 112 (3) (2004) 297-308].     

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

In this paper, we describe many improvements to the number field sieve. Our main contribution consists of a new way to compute individual logarithms with the number field sieve without solving a very large linear system for each logarithm. We show that, with these improvements, the number field sieve outperforms the gaussian integer method in the hundred digit range. We also illustrate our results by successfully computing discrete logarithms with GNFS in a large prime field.

     

Hermitian forms and the large and small sieves

The author observes that two Hermitian forms have the same largest eigenvalue. A large sieve result of Roth-Bombieri type and Selberg's upper bound sieve with a Montgomery type error term are derived.     

Amplification arguments for large sieve inequalities

We give a new proof of the arithmetic large sieve inequality based on an amplification argument, and use a similar method to prove a new sieve inequality for classical holomorphic cusp forms. A sample application of the latter is also given.     

An explicit sieve bound and small values of σ(ф(m))

We prove an explicit sieve upper bound based on the large sieve of Montgomery and Vaughan [MV], and apply it to show that σ(ф(m)) ≥ m/39.4 for all positive integers m.     

Über die Verteilung von primen primitiven Wurzeln in algebraischen Zahlkörpern

Generalizing a method introduced by Elliott in the rational case to number fields in an appropriate way, asymptotic estimates are given for the number of algebraic primes in certain parallelotopes which are primitive roots for almost all (in a certain sense) prime ideal moduli. The proofs depend upon a fundamental lemma of Selberg's rational sieve method and make use of the large sieve in the setting of an algebraic number field.     

Enlarged major arcs in additive problems

Enlarged major arcs in the Waring-Goldbach problem are studied by using large sieve estimates for Dirichlet polynomials and estimates for exponential sums over primes.     

The large sieve inequality for integer polynomial amplitudes

We obtain a close to optimal version of the large sieve inequality with amplitudes given by the values of a polynomial with integer coefficients of degree ?2.     

A variational Barban–Davenport–Halberstam Theorem

We prove variational forms of the Barban–Davenport–Halberstam Theorem and the large sieve inequality. We apply our result to prove an estimate for the sum of the squares of prime differences, averaged over arithmetic progressions.     

尖点形式L函数的广义零点密度估计(英文)

In this paper a zero-density estimate of the large sieve type is given for the automorphic L-function L f (s,χ),where f is a holomorphic cusp form and χ a Dirichlet character of mod q.     

Large sieve inequality with sparse sets of moduli applied to Goldbach conjecture

We use the large sieve inequality with sparse sets of moduli to prove a new estimate for exponential sums over primes. Subsequently, we apply this estimate to establish new results on the binary Goldbach problem where the primes are restricted to given arithmetic progressions.     

大整数因子分解中的二次筛法优化

本文研究了大整数因子分解中的二次筛法，提出了算法选择，参数选择，硬件选取和过程控制上的优化途径，直接影响RSA密码系统，推动信息安全的发展。     

On polynomial selection for the general number field sieve

The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

     

Applications of the Kuznetsov formula on GL(3)

We develop a fairly explicit Kuznetsov formula on GL(3) and discuss the analytic behavior of the test functions on both sides. Applications to Weyl’s law, exceptional eigenvalues, a large sieve and L-functions are given.     

Ⅰ型区间删失情形下部分线性模型Sieve极大似然估计渐近性质

本文在响应变量的观测值为Ⅰ型区间删失数据的情形下,讨论部分线性模型Ｓｉｅｖｅ极大似然估计的渐近性质．在一定条件下证明了该估计具有强相合性;参数分量的估计具有渐近正态性,并且是渐近有效的;非参数分量估计达到了最优弱收敛速度．     

一种Sieve极大似然估计的渐近性质

该文针对部分线性模型,在响应变量的观测值为Ⅰ型区间删失数据的情形下,讨论Ｓｉｅｖｅ极大似然估计的渐近性质．用三角级数来构造Ｓｉｅｖｅ空间,在一定条件下证明了该估计具有强相合性;得到了该估计的弱收敛速度,并且非参数部分的估计达到了最优收敛速度;还算出了参数部分的信息界．     

A larger GL2 large sieve in the level aspect

In this paper we study the orthogonality of Fourier coefficients of holomorphic cusp forms in the sense of large sieve inequality. We investigate the family of GL ₂ cusp forms modular with respect to the congruence subgroups Γ₁(q), with additional averaging over the levels q ∼ Q. We obtain the orthogonality in the range N ≪ Q ^2−δ for any δ > 0, where N is the length of linear forms in the large sieve.     

嵌入定理与代数数域上的大筛法

<正> 本文把数理方程研究中常用的嵌入定理稍作推广,应用到代数数域上来,并把[4]中第四章的定理4.2和[1,5]中的均值定理推广到代数数域上. 为此,先介绍一些符号与约定,基本上采自[2]. 设K为-n次代数数域,按通常的记号,记作n=r_1+2r_2.以Z_k表K中的整数环. 1.设为一理想,如α,β∈Z_k,|(α-β),则记α≡β(mod ).按此可把K中的整数分类,其类数为N.Z_k中与互素的整数在上述分类中占住类数为