中文
相关论文

相关论文: Restriction theory of the Selberg sieve, with appl…

200 篇论文

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

数论 · 数学 2025-05-15 Daniel R. Johnston , Simon N. Thomas

It is shown that two conjectures put forward in the recent article Iksanov and Kostohryz (2025) are true. Namely, we prove a functional central limit theorem (FCLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series…

概率论 · 数学 2025-08-22 Congzao Dong , Alexander Iksanov

In this paper, we study the superconvergence phenomenon in the free central limit theorem for identically distributed, unbounded summands. We prove not only the uniform convergence of the densities to the semicircular density but also their…

概率论 · 数学 2010-10-19 Jiun-Chau Wang

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

数论 · 数学 2025-06-17 Matt Visser

Given a finite group $G$ and a prime $p$, we establish the sieve formula, which is a congruence containing as summands numbers of chains of $p$-subgroups of $G$ of certain orders. This generalises the Theorem of Sylow-Frobenius, using…

群论 · 数学 2024-07-19 Elias Schwesig

We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.

数论 · 数学 2015-10-06 D. R. Heath-Brown , Xiannan Li

Given $0\leq\alpha<1$, we define \[\begin{array}{lr} \mathbf{M}_\alpha f(u,v,t) = \sup_{ \mathbf{R} \ni (0,0,0)} {\rm vol} \{\mathbf{R}\}^{\alpha-1} \iiint_\mathbf{R}\left|f [(u,v,t)\odot(\xi,\eta,\tau)^{-1}]\right|d\xi d\eta d\tau…

经典分析与常微分方程 · 数学 2026-05-19 Chuhan Sun , Zipeng Wang

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

数论 · 数学 2024-02-16 Kaisa Matomäki , Joni Teräväinen

In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for…

数论 · 数学 2026-04-07 Daniel R. Johnston

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

数论 · 数学 2009-10-03 Oriol Serra , Gilles Zémor

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…

数论 · 数学 2007-05-23 M. Z. Garaev

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 $$\{…

数论 · 数学 2018-12-06 Gábor Hegedűs

We use a method of rotations to study the $L^p$ boundedness, $1<p<\infty$, of Fourier multipliers which arise as the projection of martingale transforms with respect to symmetric $\alpha$-stable processes, $0<\alpha<2$. Our proof does not…

概率论 · 数学 2015-08-17 Michael Perlmutter

In 1874, Mertens proved the approximate formula for partial Euler product for Riemann zeta function at $s=1$, which is called Mertens' theorem. In this paper, we generalize Mertens' theorem for Selberg class and show the prime number…

数论 · 数学 2014-07-21 Yoshikatsu Yashiro

In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…

综合数学 · 数学 2026-03-10 Theophilus Agama

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

数论 · 数学 2013-11-26 Ben J. Green , Adam J. Harper

The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the…

数论 · 数学 2019-08-20 Emily Eckels , Steven Jin , Andrew Ledoan , Brian Tobin

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,…

数论 · 数学 2015-09-09 Kaisa Matomäki , Xuancheng Shao

We prove Hypothesis H in full generality for ${\rm GL}_n$ over any number field. This result is a consequence of our stronger effective bound on Euler products involving Rankin--Selberg coefficients at prime ideal powers. The proof rests on…

数论 · 数学 2025-07-29 Yujiao Jiang

We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…

数论 · 数学 2007-05-23 Greg Martin