Stephan Baier
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.
机构、总结、中文摘要均由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.
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.
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.
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…
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 improve on the spectral large sieve inequality for symmetric-squares. We also prove a lower bound showing that the most optimistic upper bound is not true for this family.
The large sieve inequality and additive decompositions of sums of squares
该研究基于大筛法证明了针对缺失素数模平方剩余类集合的新筛法估计，将其应用于Ostmann问题，得出平方和的非平凡和集分解需由大小相近的两个集合构成的结论。
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--…
We formulate a general problem: given projective schemes $\mathbb{Y}$ and $\mathbb{X}$ over a global field $K$ and a $K$-morphism $η$ from $\mathbb{Y}$ to $\mathbb{X}$ of finite degree, how many points in $\mathbb{X}(K)$ of height at most $B$ have a pre-image under $η$ in $\mathbb{Y}(K)$? This problem is inspired by a well-known conjecture of Serre on quantitative upper bounds for the number of points of bounded height on an irreducible projective variety defined over a number field. We give a non-trivial answer to the general problem when $K=\mathbb{F}_q(T)$ and $\mathbb{Y}$ is a prime degree…
We improve on the best available bounds for the square-free sieve and provide a general framework for its applicability. The failure of the local-to-global principle allows us to obtain results better than those reached by a classical sieve-based approach. Techniques involving sphere-packing yield upper bounds on the number of integer and rational points on curves of positive genus.
Let $A$ be a $g$-dimensional abelian variety over $\mathbb{Q}$ whose adelic Galois representation has open image in $\text{GSp}_{2g} \widehat{\mathbb{Z}}$. We investigate the endomorphism algebras $\text{End}(A_p) \otimes \mathbb{Q} = \mathbb{Q}( π_p )$ of the reduction of $A$ modulo primes $p$ at which this reduction is ordinary and simple. We obtain conditional and unconditional asymptotic upper bounds on the number of primes at which this "Frobenius field" is a specified number field and, when $A$ is two-dimensional, at which the Frobenius field contains a specified real quadratic number fi…
Almost primes and primes that are sums of two squares plus 1
该研究用向量筛框架（含半线性筛、线性筛）得出满足p-1为两平方和且p+2素因子个数有界的素数p≤x的下界。
Let $E$ be an elliptic curve over $\mathbb{Q}$. Let $p$ be a prime of good reduction for $E$. Then, for a prime $p \neq \ell$, the Frobenius automorphism associated to $p$ (unique up to conjugation) acts on the $\ell$-adic Tate module of $E$. The characteristic polynomial of the Frobenius automorphism has rational integer coefficients and is independent of $\ell$. Its splitting field is called the Frobenius field of $E$ at $p$. Let $E_1$ and $E_2$ be two elliptic curves defined over $\mathbb{Q}$ that are non-isogenous over $\overline{\mathbb{Q}}$ and also without complex multiplication over $\…
Kloosterman sign changes with moduli having at most five prime factors
研究具有至多五个素因子的模的克洛斯特曼符号变化，基于解析估计和优化筛法，用几何半权重改进方法，使相关系数降低，证明归一化克洛斯特曼和每个符号出现次数\(\gg X / \log X\)，改进了前人结果。
We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K. Matomäki, replacing 10 by 23, 18 and 15, respectively. The method combines the Selberg sieve, equidistribution of Kloosterman sums and spectral theory of automorphic forms.
Explicit sieve estimates and nonexistence of odd multiperfect numbers of a certain form
本文通过证明筛法函数的显式渐近公式，证明了不存在丰度为四且平方部分无立方因子的奇多重完全数。
Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed verified by most (in a very explicit sense) of the elements of GL(n,A) with fixed determinant (where A is an intermediate ring between Z and Q that we specify) or by (special) orthogonal matrices with integral entries and fixed spinor norm.
Symmetric Square Large Sieve for $\mathrm{PSL}_2 (\mathbb{Z} {[i]}) \backslash \mathrm{PSL}_2 (\mathbb{C}) $ and Prime Geodesic Theorem for $ \mathrm{PSL}_2 (\mathbb{Z} {[i]}) \backslash \mathbb{H}^3 $
本文针对PSL₂(Z[i])\H³的素测地线定理误差项，通过建立PSL₂(Z[i])\PSL₂(C)上对称平方的谱大筛不等式，将对称平方L-函数二阶矩的界从O(T^{3+2/3+ε})改进为O(T^{3+1/2+ε})。
We prove a version of the Bombieri--Vinogradov Theorem with certain products of Gaussian primes as moduli, making use of their special form as polynomial expressions in several variables. Adapting Vaughan's proof of the classical Bombieri--Vinogadov Theorem to this setting, we apply the polynomial large sieve inequality that has been recently proved and which includes recent progress in Vinogradov's mean value theorem due to Parsell et al. From the benefit of these improvements, we obtain an extended range for the variables compared to the range obtained from standard arguments only.
Distribution of square-free palindromes
研究平方自由回文数的分布，通过回文数在算术进展中的上界估计，结合指数和估计、6近似质回文数研究及大筛法，建立分布指数为1/16的结论。
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 study the distribution of squares modulo a square-free number $q$. We also look at inverse questions for the large sieve in the distribution aspect and we make improvements on existing results on the distribution of $s$-tuples of reduced residues.
We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some interval I_p of Z/pZ of length (p-1)/2. Let A be the set that remains: then |A| << N^{1/3 + o(1)}, a bound which improves slightly on the bound of |A| << N^{1/2} which results from applying the large sieve in its usual form. This is a very, very weak result in the direction of a question of Helfgott and Venkatesh, who suggested that nothing like equality can occu…
On bilinear sums with modular square roots and applications III
本文改进了之前方法，针对素数平方模，通过限制二次高斯和到简化剩余类，实现显著消去，提升双线性和的分析。
Application of a polynomial sieve: beyond separation of variables
本文首次应用多项式筛法解决非变量分离情形下的零点计数问题，为塞雷的问题提供了新结果。
Bilinear forms with Kloosterman sums via quadratic characters
研究带有克洛斯特曼和的双线性形式，基于与二次特征和的新联系证明新界限，在临界范围有改进，还给出在扭曲L函数矩及特殊马阿斯形式大筛法中的应用。
On bilinear sums with modular square roots and applications II
本文进一步研究了带有模平方根的双线性和和加性能量，改进了变量范围较大时的结果，并在平方模数的大筛理论中取得进展。
Almost primes between all squares
本文证明了对于所有 $n\geq 1$，在 $n^2$ 和 $(n+1)^2$ 之间存在至多有 4 个素因子的数，这是首个对所有 $n$ 成立的此类结果，方法依赖 Sorenson 和 Webster 的计算、显式线性筛法及新证明的显式 Kuhn 加权筛法。
We prove that the average size of the squares of differences between consecutive primes less than $x$ is $O(x^{0.23+\varepsilon})$ for any fixed $\varepsilon>0$. This improves on a result of Peck, who gave bound $O(x^{0.25+\varepsilon})$ in the place of $O(x^{0.23+\varepsilon})$. Key ingredients are Harman's sieve, Heath-Brown's mean value theorem for sparse Dirichlet polynomials and Heath-Brown's $R^*$ bound.
The least prime with a given primitive root and a variant of the larger sieve
本文在广义黎曼猜想下，将给定原根的最小素数上界改进为对数三次方量级，并证明大筛法新变体，优于现有结果。
Sign changes of Kloosterman sums with moduli having at most six prime factors
本文通过引入新的截断除数函数，改进了克洛斯特曼和符号变化的研究结果，结合了多种数学工具。
We show that if an essentially arbitrary sequence supported on an interval containing $x$ integers, is convolved with a tiny Siegel-Walfisz-type sequence supported on an interval containing $\exp((\log x)^{\varepsilon})$ integers then the resulting multiplicative convolution has (in a weak sense) level of distribution $x^{1/2 + 1/66 - \varepsilon}$ as $x$ goes to infinity. This dispersion estimate has a number of consequences for: the distribution of the $k$th divisor function to moduli $x^{1/2 + 1/66 - \varepsilon}$ for any integer $k \geq 1$, the distribution of products of exactly two prime…
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.
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 …
Divisibility Estimates for Gaussian Norms and Almost-Prime Orders of a CM Elliptic Curve
该研究针对椭圆曲线E:y²=x³-x，结合高斯CM筛框架与交叉项，证明了特定素数p下#E(F_p)/8的无平方因子性及素因子个数限制，为相关数论问题提供了可除性估计与分布结果。
Representations of positive integers by three almost-prime squares
本文利用高维筛法和Richert型加权筛法，证明了满足特定同余条件的大整数可表示为三个平方和，且乘积或每个平方根为几乎素数，改进了Waibel和Banerjee的结果。
We obtain the analog of the Bombieri-Vinogradov theorem for square moduli up to any power of x less than 1/2.
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
Sieving with square conditions and applications to Hilbert cubes in arithmetic sets
本文探讨了Gallagher筛法在模素数平方下的应用局限，并提出通过转换余数信息以提升筛法效果，同时研究了Hilbert立方体在不同乘法定义集中的最大维度，得出了相关上界。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。