Related papers: The large sieve with power moduli for $\mathbb{Z}[…

In this work we present a newly developed study of the interpolation of weighted Sobolev spaces by the complex method. We show that in some cases, one can obtain an analogue of the famous Stein-Weiss theorem for weighted $L^{p}$ spaces. We…

In this paper we study the problem of deriving further Sobolev inequalities from a given Sobolev inequality. We use several different methods, including Bessel potentials and Riesz transforms. We apply the results to the Ricci flow to…

We prove a sharp quantitative form of isocapacitary inequality in the case of a general $p$. This work is a generalization of the author's paper with Guido De Philippis and Michele Marini, where we treated the case of $2$-capacity.

To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…

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.

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We investigate three combinatorial problems considered by Erd\"os, Rivat, Sark\"ozy and Sch\"on regarding divisibility properties of sum sets and sets of shifted products of integers in the context of function fields. Our results in this…

The main goal of this expository article is to survey recent progress on the arithmetic Siegel-Weil formula and its applications. We begin with the classical sum of two squares problem and put it in the context of the Siegel-Weil formula.…

In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…

For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…

This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $\alpha\in (0,1/2)$. Suppose that $|X\pmod p|\leq (\alpha+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the…

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

We generalize the standard Poisson summation formula for lattices so that it operates on the level of theta series, allowing us to introduce noninteger dimension parameters (using the dimensionally continued Fourier transform). When…

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…

We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…

A general sieve method for groups is formulated. It enables one to "measure" subsets of a finitely generated group. As an application we show that if $\Gamma$ is a finitely generated non virtually-solvable linear group of characteristic…

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

We generalise the square sieve developed by Heath-Brown to higher powers in order to improve on the error term for the problem of counting consecutive power-free numbers.