An Improvement of a Large Sieve Inequality in High Dimensions

显式二次大筛不等式

Explicit quadratic large sieve inequality

本文得到了Heath-Brown二次特征大筛不等式的显式版本，并讨论了其在L-函数和二次域中的应用。

A new bound for the large sieve inequality with power moduli

We give a new bound for the large sieve inequality with power moduli q^k that is uniform in k. The proof uses a new theorem due to T. Wooley from his work on efficient congruencing.

The large sieve inequality with square moduli for quadratic extensions of function fields

In this paper, we establish a version of the large sieve with square moduli for imaginary quadratic extensions of rational function fields of odd characteristics.

A large sieve inequality of Elliott--Montgomery--Vaughan type for Maass forms on GL(n,R) with applications

In this paper, we establish a large sieve inequality of Elliott-Montgomery-Vaughan type for Maass forms on GL(n, R) and explore three applications.

A quadratic large sieve inequality over number fields

We formulate and prove a large sieve inequality for quadratic characters over a number field. To do this, we introduce the notion of an n-th order Hecke family. We develop the basic theory of these Hecke families, including versions of the Poisson summation formula.

二次模数的大型筛不等式

A large sieve inequality for characters to quadratic moduli

本文提出了一种针对二次模数的大型筛不等式，并应用该结果推导了与特定导数乘法字符相关的$ L $-函数扭系数的加权零密度估计。

Amplification arguments for large sieve inequalities

We present a new proof of the "arithmetic" large sieve inequality, starting from the corresponding "harmonic" inequality, which is based on an amplification idea. We show that this also adapts to give some new sieve inequality for modular forms, where Hecke eigenvalues are thought as the analogues of the reductions of integers modulo primes.

Large sieve inequality with power moduli for function fields

In this paper, we establish a general version of the large sieve with additive characters for restricted sets of moduli in arbitrary dimension for function fields. From this, we derive function field versions for the large sieve in high dimensions and for power moduli.

关于 $\mathrm{PGL}_2 (\mathbb{Z}[i]) \backslash \mathrm{PGL}_2 (\mathbb{C})$ 的扭曲谱大筛不等式

On the Twisted Spectral Large Sieve Inequality for $\mathrm{PGL}_2 (\mathbb{Z}[i]) \backslash \mathrm{PGL}_2 (\mathbb{C})$

本文将 Deshouillers 等人的扭曲谱大筛不等式从 $\mathrm{SL}_2 (\mathbb{Z})$ 扩展至 $\mathrm{PGL}_2 (\mathbb{Z}[i])$。

大筛法不等式与平方和的加法分解

The large sieve inequality and additive decompositions of sums of squares

该研究基于大筛法证明了针对缺失素数模平方剩余类集合的新筛法估计，将其应用于Ostmann问题，得出平方和的非平凡和集分解需由大小相近的两个集合构成的结论。

通过Parseval的加权大筛法

The weighted large sieve through Parseval

本文通过Parseval恒等式而非近似Bessel不等式改进大筛法的算术形式，从而在加权大筛法不等式上取得超越先前方法启发式界限的改进，并讨论了该方法的优化性。

Large Sieve Inequalities for Characters to Square Moduli

In this paper, we develop a large sieve type inequality with characters to square moduli. One expects that the result should be weaker than the classical inequality, but, conjecturally at least, not by much. The method is generalizable to higher power moduli.

The Large Sieve Inequality for Quadratic Polynomial Amplitudes

We provide here a modest improvement upon a large sieve inequality for quadratic polynomial amplitudes orginally due to Liangyi Zhao.

On the exponential large sieve inequality for sparse sequences modulo primes

We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $λ^{s_n}$. In particular, we obtain a result which is non-trivial for monotonically increasing sequences $\cal{S}=\{s_n \}_{n=1}^{\infty}$ provided $s_n\le n^{2+o(1)}$, whereas the original argument of M. Z. Garaev requires $s_n \le n^{15/14 +o(1)}$ in the same setting. We also give an application of our result to arithmetic properties of integers with almost all digits prescribed.

关于 $\mathrm{PGL}_2 (\mathbb{Z}[i]) \backslash \mathrm{PGL}_2 (\mathbb{C})$ 的谱大筛不等式

On the Spectral Large Sieve Inequality for $\mathrm{PGL}_2 (\mathbb{Z}[i]) \backslash \mathrm{PGL}_2 (\mathbb{C})$

本文引入复Bessel积分的简明表达式，改进了Watt关于PGL_2(Z[i])\PGL_2(C)的谱大筛不等式，并在谱参数平均值位于以(0,0)为中心的正方形时取得理想结果。

非阿贝尔大筛法与阿廷原根猜想

A non-abelian large sieve and Artin's primitive root conjecture

本文研究经典阿贝尔大筛法不等式的非阿贝尔推广，假设该推广成立可证明阿廷原根猜想，还通过对偶技术得到针对该推广的无条件结果。

The large sieve with square norm moduli in Z[i]

We prove a large sieve inequality for square norm moduli in Z[i].

一个与埃拉托斯特尼筛法相关的不等式

An inequality related to the sieve of Eratosthenes

本文研究埃拉托斯特尼筛法相关的计数函数 $Φ(x,y)$，证明了除少数小情形外，当 $y\le\sqrt{x}$ 时该函数满足严格上界 $Φ(x,y)<.6x/\log y$。

通过Parseval的加权大筛法

The weighted large sieve through Parseval

本文通过使用Parseval恒等式改进加权大筛不等式，并计算了Beurling-Selberg优超函数的L2范数。

Large sieve inequalities for quartic characters

In this paper, we prove a large sieve inequality for quartic Dirichlet characters. The result is analogous to large sieve inequalities for the quadratic and cubic Dirichlet characters.

变水平自对偶 Eisenstein 级数的大筛法

The large sieve for self-dual Eisenstein series of varying levels

本文证明了变水平自对偶 Eisenstein 级数的最优大筛不等式，可解释为有理数按高度排序的大筛，方法递归且与已知大筛法有共同点。

Asymptotic Large Sieve

Motivated by applications to the study of L-functions, we develop an asymptotic version of the large sieve inequality for linear forms in primitive Dirichlet characters.

Large Sieve Inequalities 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.

Spacing and A Large Sieve Type Inequality for Roots of a Cubic Congruence

Motivated by a desire to understand the distribution of roots of cubic congruences, we re-derive a parametrization of roots $ν\pmod m$ of $X^3 \equiv 2 \pmod m$ found by Hooley. Although this parametrization does not lead us here to anything towards proving equidistribution of the sequence $\fracν{m} \pmod 1$, we are able to prove spacing results, and then a large sieve type inequality, which we view as analogous to the large sieve inequality for roots of quadratic congruences found by Fouvry and Iwaniec in their proof that there are infinitely many primes of the form $n^2 + p^2$. The parametr…

Luo的谱大筛法不等式在短区间上的推广

Luo's Spectral Large Sieve Inequality on Short Intervals

本文在短区间上推广Luo的谱大筛法不等式，证明Eisenstein-Kloosterman相消在$T<t_j\le T+M$（$\sqrt{T}<M\le T$）有效，并改进原不等式。

Large Sieve Inequalities for Special Characters to Prime Square Moduli

In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.

An Improvement for the Large Sieve for Square Moduli

We establish a result on the large sieve with square moduli. These bounds impro ve recent results by S. Baier(math.NT/0512228) and L. Zhao(math.NT/0508125).

Limiting distribution of eigenvalues in the large sieve matrix

The large sieve inequality is equivalent to the bound $λ_1 \leqslant N + Q^2-1$ for the largest eigenvalue $λ_1$ of the $N$ by $N$ matrix $A^{\star} A$, naturally associated to the positive definite quadratic form arising in the inequality. For arithmetic applications the most interesting range is $N \asymp Q^2$. Based on his numerical data Ramaré conjectured that when $N \sim αQ^2$ as $Q \rightarrow \infty$ for some finite positive constant $α$, the limiting distribution of the eigenvalues of $A^{\star} A$, scaled by $1/N$, exists and is non-degenerate. In this paper we prove this conjecture …

Expansion and Improvement of Sieve and application in Goldbach's problem

This paper expands and improves on the general Sieve method. This expaned and improved Sieve is applied to Goldbach's problem. A new estimate of the exception set in Goldbach's number E(X), an improved lower bound D_{1,2}(N) and upper bound D(N) are proposed. The proposed values are: |E(X)|<= X^{0.702+e}, D_{1,2}(N)>= 2.27C(N)/ln^{2}(N), D(N) <= 6.916C(N)/ln^{2}(N).

The large sieve with power moduli for $\mathbb{Z}[i]$

We establish a large sieve inequality for power moduli in $\mathbb{Z}[i]$, extending earlier work by L. Zhao and the first-named author on the large sieve for power moduli for the classical case of moduli in $\mathbb{Z}$. Our method starts with a version of the large sieve for $\mathbb{R}^2$. We convert the resulting counting problem back into one for $\mathbb{Z}[i]$ which we then attack using Weyl differencing and Poisson summation.

Primes in short arithmetic progressions

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg sieve.

关于 Bombieri-Davenport 大筛法不等式的注记

Remarks on the Bombieri-Davenport Large Sieve Inequalities

本文对特殊序列的 Bombieri-Davenport 大筛法不等式进行了改进。

Legendre符号在短区间上的大筛不等式

Large sieve inequality for sums of Legendre symbols over short intervals

本文利用Burgess界和Selberg筛法，研究Legendre符号在短区间上的二次矩界，并在特定条件下获得对h的幂次改进。

Additive energy and a large sieve inequality for sparse sequences

We consider the large sieve inequality for sparse sequences of moduli and give a general result depending on the additive energy (both symmetric and asymmetric) of the sequence of moduli. For example, in the case of monomials $f(X) = X^k$ this allows us to improve, in some ranges of the parameters, the previous bounds of S. Baier and L. Zhao (2005), K.~Halupczok (2012, 2015, 2018) and M.~Munsch (2020). We also consider moduli defined by polynomials $f(X) \in \mathbb{Z}[X]$, Piatetski-Shapiro sequences and general convex sequences. We then apply our results to obtain a version of the Bombieri--…

平方模的大筛法再探

The large sieve for square moduli, revisited

本文在假设模平方根的更高加法能量条件下，改进了平方模的大筛法。

The larger sieve and polynomial congruences

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

An Improvement to the Number Field Sieve

We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is less than two-thirds of the running time of the algorithm used before asymptotically with probability gr

On an inverse ternary Goldbach problem

We prove an inverse ternary Goldbach-type result. Let $N$ be sufficiently large and $c>0$ be sufficiently small. If $A_1,A_2,A_3\subset [N]$ are subsets with $|A_1|,|A_2|,|A_3|\geq N^{1/3-c}$, then $A_1+A_2+A_3$ contains a composite number. This improves on the bound $N^{1/3}$ from Gallagher's larger sieve. The main ingredients in our argument include a type of inverse sieve result in the larger sieve regime, and a variant of the analytic large sieve inequality.

The principle of the large sieve

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function fields. The general framework suggests new applications. We get some first results on the number of prime divisors of ``most'' elements of an elliptic divisibility sequence, and we develop in some detail ``probabilistic'' sieves for random walks on arithmetic groups, e.g., estimating the probability of finding a reducible characteristic polynomial at some st…

On the distribution of fractions with power denominator

In this paper we obtain a sharp upper bound for the number of solutions to a certain diophantine inequality involving fractions with power denominator. This problem is motivated by a conjecture of Zhao concerning the spacing of such fractions in short intervals and the large sieve for power modulus. As applications of our estimate we show Zhao's conjecture is true except for a set of small measure and give a new $\ell_1 \rightarrow \ell_2$ large sieve inequality for power modulus.

On Some Improvements of the Brun-Titchmarsh Theorem. IV

We show a new large sieve version of the Brun-Titchmarsh theorem.

Improvements to the number field sieve for non-prime finite fields

We propose various strategies for improving the computation of discrete logarithms in non-prime fields of medium to large characteristic using the Number Field Sieve. This includes new methods for selecting the polynomials; the use of explicit automorphisms; explicit computations in the number fields; and prediction that some units have a zero virtual logarithm. On the theoretical side, we obtain a new complexity bound of $L_{p^n}(1/3,\sqrt[3]{96/9})$ in the medium characteristic case. On the practical side, we computed discrete logarithms in $F_{p^2}$ for a prime number $p$ with $80$ decimal …

几何格的布伦不等式

Brun's inequality for a geometric lattice

本文在几何格上证明了布伦不等式并发展相应筛法，利用拟阵惠特尼数对数凹性，并研究道林格惠特尼数移位卷积及广义道林数渐近公式。

Character sums with smooth numbers

We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,χ)$ of moduli $q$ and primitive characters $χ$ modulo $q$, for which the corresponding character sums with smooth numbers are large.

Almost all elliptic curves are Serre curves

Using a multidimensional large sieve inequality, we obtain a bound for the mean square error in the Chebotarev theorem for division fields of elliptic curves that is as strong as what is implied by the Generalized Riemann Hypothesis. As an application we prove a theorem to the effect that, according to height, almost all elliptic curves are Serre curves, where a Serre curve is an elliptic curve whose torsion subgroup, roughly speaking, has as much Galois symmetry as possible.

Multiplicative mimicry and improvements of the Polya-Vinogradov inequality

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet character. As an application we improve current bounds on odd order character sums. Furthermore, conditionally on the Generalized Riemann Hypothesis we obtain a bound for odd order character sums which is best possible.

An improvement of an inequality of Ochem and Rao concerning odd perfect numbers

Let $Ω(n)$ denote the total number of prime divisors of $n$ (counting multiplicity) and let $ω(n)$ denote the number of distinct prime divisors of $n$. Various inequalities have been proved relating $ω(N)$ and $Ω(N)$ when $N$ is an odd perfect number. We improve on these inequalities. In particular, we show that if $3 \not| N$, then $Ω\geq \frac{8}{3}ω(N)-\frac{7}{3}$ and if $3 |N$ then $Ω(N) \geq \frac{21}{8}ω(N)-\frac{39}{8}.$

Large odd order character sums and improvements of the Pólya-Vinogradov inequality

For a primitive Dirichlet character $χ$ modulo $q$, we define $M(χ)=\max_{t } |\sum_{n \leq t} χ(n)|$. In this paper, we study this quantity for characters of a fixed odd order $g\geq 3$. Our main result provides a further improvement of the classical Pólya-Vinogradov inequality in this case. More specifically, we show that for any such character $χ$ we have $$M(χ)\ll_{\varepsilon} \sqrt{q}(\log q)^{1-δ_g}(\log\log q)^{-1/4+\varepsilon},$$ where $δ_g := 1-\frac{g}π\sin(π/g)$. This improves upon the works of Granville and Soundararajan and of Goldmakher. Furthermore, assuming the Generalized Ri…

关于模素数下具有丰富加法结构集合的反向定理

An inverse theorem on sets with rich additive structure modulo primes

本文研究了模素数下具有丰富加法结构集合的反向定理，证明了相关结构结果并改进了较大筛法界。

A conjectural improvement for inequalities related to regulators of number fields

An inequality proved firstly by Remak and then generalized by Friedman shows that there are only finitely many number fields with a fixed signature and whose regulator is less than a prescribed bound. Using this inequality, Astudillo, Diaz y Diaz, Friedman and Ramirez-Raposo succeeded to detect all fields with small regulators having degree less or equal than 7. In this paper we show that a certain upper bound for a suitable polynomial, if true, can improve Remak-Friedman's inequality and allows a classification for some signatures in degree 8 and better results in degree 5 and 7. The validity…

基于平方条件的筛法及其在算术集中的Hilbert立方体应用

Sieving with square conditions and applications to Hilbert cubes in arithmetic sets

本文探讨了Gallagher筛法在模素数平方下的应用局限，并提出通过转换余数信息以提升筛法效果，同时研究了Hilbert立方体在不同乘法定义集中的最大维度，得出了相关上界。