English
Related papers

Related papers: On smooth gaps between primes using the Maynard-Ta…

200 papers

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…

Number Theory · Mathematics 2014-04-15 Harald Andrés Helfgott

We investigate the group of points of the $3$-sphere modulo a prime, point out connections to other known groups and the Chebyshev polynomials, and show that there is an infinite series which converges if and only if there are finitely many…

Number Theory · Mathematics 2024-07-09 Samuel A. Hambleton

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).

Number Theory · Mathematics 2016-03-11 Hongze Li , Hao Pan

Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teuli\'e asked whether $\inf_{q \ge 1} \, q \cdot || q \alpha || \cdot |…

Number Theory · Mathematics 2015-09-30 Dmitry Badziahin , Yann Bugeaud , Manfred Einsiedler , Dmitry Kleinbock

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

Number Theory · Mathematics 2016-03-28 Terence Tao , Tamar Ziegler

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

Number Theory · Mathematics 2019-08-26 Ryan Alweiss , Sammy Luo

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Number Theory · Mathematics 2025-09-25 Le Duc Hieu

For prime degree hypersurfaces of dimension at least 3, Mori asked if every smooth proper limit is still a hypersurface. Interestingly in dimensions 1 and 2, this is not the case. For example, Griffin constructed explicit families of…

Algebraic Geometry · Mathematics 2022-08-25 Kristin DeVleming , David Stapleton

We prove the "Sullivan Conjecture" on the classification of 4-dimensional complete intersections up to diffeomorphism. Here an $n$-dimensional complete intersection is a smooth complex variety formed by the transverse intersection of $k$…

Geometric Topology · Mathematics 2025-02-11 Diarmuid Crowley , Csaba Nagy

A cyclic quotient singularity of type $p^2/pq-1$ ($0<q<p, (p,q)=1$) has a smoothing whose Milnor fibre is a $\mathbb Q$HD, or rational homology disk (i.e., the Milnor number is $0$) ([9], 5.9.1). In the 1980's, we discovered additional…

Algebraic Geometry · Mathematics 2020-06-29 Jonathan Wahl

The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by…

Data Structures and Algorithms · Computer Science 2025-10-22 Sophie Huiberts , Yin Tat Lee , Xinzhi Zhang

Towards a well-known open question in arithmetic dynamics, L. M\'erai, A. Ostafe and I. E. Shparlinski (2023), have shown, for a class of polynomials $f \in \mathbb Z[X]$, which in particular includes all quadratic polynomials, that, under…

Number Theory · Mathematics 2024-11-15 Alina Ostafe , Igor E. Shparlinski

Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$ (computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[…

Number Theory · Mathematics 2020-12-09 Habiba Kadiri

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

Number Theory · Mathematics 2023-02-23 Valentin Blomer , Lasse Grimmelt , Junxian Li , Simon L. Rydin Myerson

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

General Mathematics · Mathematics 2016-06-20 N. A. Carella

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

Number Theory · Mathematics 2023-12-05 Alexander Kalmynin , Sergei Konyagin

Taking the easy option I prove that one can lower Zhang's bound on prime gaps from 70 million to 60 million. A poor man's improvement indeed!

Number Theory · Mathematics 2013-06-05 T. S. Trudgian

Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…

Number Theory · Mathematics 2013-09-23 Andrew V. Lelechenko

This article concerns two conjectures of M. P. Murthy. For Murthy's conjecture on complete intersections, the major breakthrough has still been the result proved by Mohan Kumar in 1978. In this article we improve "Mohan Kumar's bound" when…

Commutative Algebra · Mathematics 2017-12-18 Mrinal Kanti Das

Translated from the Latin original "Facillima methodus plurimos numeros primos praemagnos inveniendi" (1778). E718 in the Enestrom index. If m is a number of the form 4k+1 and is a sum of two relatively prime squares, then it is prime if…

History and Overview · Mathematics 2008-08-23 Leonhard Euler