Stephan Baier
Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then apply our result to the case when S consists of sqares. In this case we obtain an estimate which improves a recent result by L. Zhao.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We give a short alternative proof using Heath-Brown's square sieve of a bound of the author for the large sieve with square moduli.
We prove a large sieve inequality for square norm moduli in Z[i].
The large sieve for square moduli, revisited
本文在假设模平方根的更高加法能量条件下，改进了平方模的大筛法。
In this note we give a new bound for large sieve with characters to power moduli which improves in some range of the parameters the previous bounds of Baier/Zhao and Halupczok.
We establish large sieve inequalities for power moduli in imaginary quadratic number fields, extending earlier work of Baier and Bansal for the Gaussian field.
We prove an estimate for the large sieve with square moduli which improves a recent result of L. Zhao. Our method uses an idea of D. Wolke and some results from Fourier analysis.
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.
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.
We prove a lower bound for the large sieve with 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.
We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with sparse sets of moduli. We then use this result to obtain large sieve bounds for the cases when $\mathcal{S}$ consists of squares of Gaussian integers and of Gaussian primes. Our bound for the case of square moduli improves a recent result by the authors.
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.
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.
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).
In this paper we aim to generalize the results in Baier and Zhao and develop a general formula for large sieve with characters to powerful moduli that will be an improvement to the result of Zhao.
Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then use this result together with Fourier techniques to obtain large sieve bounds for the case when S consists of squares. These bounds improve a recent result by L. Zhao.
We prove a lower and an upper bound for the large sieve with square moduli for function fields. These bounds correspond to bounds for the classical large sieve with square moduli established in arXiv:1812.05844 by Baier, Lynch and Zhao and arXiv:math/0512271 by Baier and Zhao. Our lower bound in the function field setting contradicts an upper bound obtained in arXiv:1802.03131 by Baier and Singh. Indeed, we point out an error in arXiv:1802.03131.
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.
A large sieve inequality for characters to quadratic moduli
本文提出了一种针对二次模数的大型筛不等式，并应用该结果推导了与特定导数乘法字符相关的$ L $-函数扭系数的加权零密度估计。
We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens previous results of the first author in two aspects: the range of the moduli as well as the class of polynomials which can be handled. As a consequence, we deduce that there exist infinitely many primes $p$such that $p-1$ has a prime divisor of size $\gg p^{2/5+o(1)}$ that is the value of an incomplete norm form polynomial.
Selberg sieve weights and sign changes of Kloosterman sums. II. Square-free moduli with at most four prime factors
本文证明对每个符号，存在大量（\\(\gg X/\log X\\)）至多四个素因子的无平方因子模\\(q\\)，其归一化Kloosterman和取该符号，方法结合Selberg筛与等分布及均方估计。
Primes in arithmetic progressions to large moduli and refinements of Harman's sieve
利用多作者算术信息与Harman筛法变体，构造素数指示函数的上下界，得到模数达x^{9/17}的双线性形式和模数达x^{17/32}的三线性形式的均值定理，并给出π(x;q,a)的几乎全部模数q的新上下界。
We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was log p to an exponent tending to infinity with p, lies in the use of the linear sieve (a particular version called the shifted sieve) rather than Brun's sieve. The same methods allow us to rederive a conditional result of Shoup on the least prime primitive root (mod p) for all prime moduli p, assuming the generalized Riemann hypothesis. We also extend both res…
We survey the recent applications and developments of sieve methods related to discrete groups, especially in the case of infinite index subgroups of arithmetic groups.
Large sieve inequalities with power moduli and Waring's problem
本文通过将大筛法不等式与华林问题的受限变体关联，并利用经典除数界和 Wooley 的指数和均值结果，改进了所有 k≥4 情形下带 k 次幂模的大筛法不等式，同时给出了基于 Hardy-Littlewood 猜想公式的条件性结果。
Partial progress towards the large sieve for square moduli
本文基于Bag和Shparlinski的方法，研究了双线性和在s=1/2时的情况，探讨了模平方根的存在性，并回顾了相关双线性和的研究成果。
We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-ε}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and Iwaniec, who handled moduli of size at most $x^{4/7-ε}$. This has consequences for the level of distribution for sieve weights coming from the linear sieve.
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.
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--…
Kloosterman sign changes with moduli having at most five prime factors
研究具有至多五个素因子的模的克洛斯特曼符号变化，基于解析估计和优化筛法，用几何半权重改进方法，使相关系数降低，证明归一化克洛斯特曼和每个符号出现次数\(\gg X / \log X\)，改进了前人结果。
Exceptional characters and prime numbers in sparse sets
本文在假设有无穷多个例外特征的前提下提出素数下界筛法，以更少算术信息获得非平凡下界，并据此证明形如 $a^2+b^8$ 的素数有无穷多个。
The large sieve for square moduli under Hooley's hypothesis $R^*$
在Hooley假设$R^*$下，将平方模数大筛法在临界点$N=Q^3$的界改进为$Q^{1/2-1/134+\varepsilon}$，通过精确计算高斯和将模平方根和转化为Salié和，获得对所有模数有效的平方根抵消。
In this paper, we establish theorems of Bombieri-Vinogradov type and Barban-Davenport-Halberstam type for sparse sets of moduli. As an application, we prove that there exist infinitely many primes of the form $p=am^2+1$ such that $a\leq p^{5/9+ε}$.
On bilinear sums with modular square roots and applications III
本文改进了之前方法，针对素数平方模，通过限制二次高斯和到简化剩余类，实现显著消去，提升双线性和的分析。
We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^θ$ for $θ=1/2+1/2000.$ This improves the work of Matomäki (2009) who obtained the result for $θ=1/2-\varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $θ=4/9-\varepsilon.$ Similarly as in the work of Matomäki, we apply Harman's sieve method to detect primes $p \equiv 1 \, (d^2)$. To break the $θ=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d^2$ by using a similar argument as …
Let $X$ be a quasi-projective variety over a number field, admitting (after passage to $\mathbb{C}$) a geometric variation of Hodge structure whose period mapping has zero-dimensional fibers. Then the integral points of $X$ are sparse: the number of such points of height $\leq B$ grows slower than any positive power of $B$. For example, homogeneous integral polynomials in a fixed number of variables and degree, with discriminant divisible only by a fixed set of primes, are sparse when considered up to integral linear substitutions.
A Bombieri-Vinogradov-type theorem for moduli with small radical
本文将关于素数幂稀疏集的 Bombieri-Vinogradov 型定理推广至具有小根的模的稀疏集，通过结合先前方法与 Roger Baker 的一般模结论得出结果。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。