Related papers: On a variant of the large sieve

Some difficulties regarding the application of the well-known sieve method are considered in the case when a practical (program) realization of selecting elements, having a particular property among the elements of a set with a sufficiently…

In this paper, we present an improvement of a large sieve type inequality in high dimensions and discuss its implications on a related problem.

We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…

In spite of a recent breakthrough on upper bounds of the size of cap sets (by Croot, Lev and Pach (2017) and Ellenberg and Gijswijt (2017)), the classical cap set constructions had not been affected. In this work, we introduce a very…

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 introduce a novel sieve for prime numbers based on detecting topological obstructions in a M\"obius-transformed rational metric space. Unlike traditional sieves which rely on divisibility, our method identifies primes as those numbers…

The "Nicolas-Serre code", $(a,b) \leftrightarrow t^{n}$, is a bijection between $N\times N$ and those $t^{n}$, $n$ odd, in $Z/2[t]$. Suppose $A_{n}$, $n$ odd, in $Z/2[t]$ are defined by: $A_{1}= A_{5}= 0$, $A_{3}= t$, $A_{7}= t^{5}$, and…

We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…

In sparse convolution-type problems, a common technique is to hash the input integers modulo a random prime $p\in [Q/2,Q]$ for some parameter $Q$, which reduces the range of the input integers while preserving their additive structure.…

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

We prove a lower bound for the large sieve with square moduli.

We study the average size of shifted convolution summation terms related to the problem of Quantum Unique Ergodicity on ${\rm SL}_2 (\mathbbm{Z})\backslash \mathbbm{H}$. Establishing an upper-bound sieve method for handling such sums, we…

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new…

We consider variable selection problem in linear regression using mixture of $g$-priors. A number of mixtures are proposed in the literature which work well, especially when the number of regressors $p$ is fixed. In this paper, we propose a…

Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c…

The classical Cauchy--Davenport inequality gives a lower bound for the size of the sum of two subsets of ${\mathbb Z}_p$, where $p$ is a prime. Our main aim in this paper is to prove a considerable strengthening of this inequality, where we…

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.