中文
相关论文

相关论文: Roth's theorem in the primes

200 篇论文

For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…

数论 · 数学 2011-10-12 Andy Loo

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

代数几何 · 数学 2009-06-03 A. I. Molev

A famous conjecture of Artin asserts that any integer $a$ that is neither $-1$ nor a square should be a primitive root (mod $p$) for a positive proportion of primes $p$. Moreover, using a heuristic argument, Artin guessed an explicit…

数论 · 数学 2025-02-28 Leo Goldmakher , Greg Martin , Paul Péringuey

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

数论 · 数学 2016-02-08 Tigran Hakobyan

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

数论 · 数学 2020-04-20 Lucile Devin

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

数论 · 数学 2015-06-26 P. Kurlberg , C. Pomerance

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

动力系统 · 数学 2007-05-23 Nikos Frantzikinakis , Bernard Host , Bryna Kra

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

经典分析与常微分方程 · 数学 2013-06-11 Izabella Laba , Malabika Pramanik

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

数论 · 数学 2019-11-13 Pieter Moree , Min Sha

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

数论 · 数学 2024-03-19 Thomas Wright

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with…

经典分析与常微分方程 · 数学 2021-06-18 Rui Han , Michael T Lacey , Fan Yang

It is shown in our earlier paper that, using only tools of elementary geometry, the classical Routh's theorem for triangles can be fully extended to tetrahedra. In this article we first give another proof of Routh's theorem for tetrahedra…

度量几何 · 数学 2014-11-19 Frantisek Marko , Semyon Litvinov

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

数论 · 数学 2024-03-27 Gregory Debruyne

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

数论 · 数学 2023-03-13 John B Friedlander , Henryk Iwaniec

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

We show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent…

数论 · 数学 2019-10-30 James Maynard

The sequence of the primes $p$ for which a variety over $\mathbb{Q}$ has no $p$-adic point plays a fundamental role in arithmetic geometry. This sequence is deterministic, however, we prove that if we choose a typical variety from a family…

数论 · 数学 2020-05-18 Efthymios Sofos

In this paper, we prove several results on the structure of maximal sets $S \subseteq [N]$ such that $S$ mod $p$ is contained in a short arithmetic progression, or the union of short progressions, where $p$ ranges over a subset of primes in…

数论 · 数学 2025-12-05 Ernie Croot , Junzhe Mao , Chi Hoi Yip

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

数论 · 数学 2012-06-29 D. A. Goldston , A. H. Ledoan

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

数论 · 数学 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim