Related papers: The large sieve with power moduli for $\mathbb{Z}[…
We prove a large sieve inequality for square norm moduli in Z[i].
We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations…
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.
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…
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 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 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 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…
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 apply our result to the case when S consists of sqares.…
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…
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).
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…
We revisit the large sieve for square moduli and obtain conditional improvements under hypotheses on higher additive energies of modular square roots.
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 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$…
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…
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…
Let $\lambda$ be a fixed integer, $\lambda\ge 2.$ Let $s_n$ be any strictly increasing sequence of positive integers satisfying $s_n\le n^{15/14+o(1)}.$ In this paper we give a version of the large sieve inequality for the sequence…
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…