English
Related papers

Related papers: A Vinogradov-type problem in almost primes

200 papers

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…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Based on the work of Green, Tao and Ziegler, we give asymptotics when $N \to \infty$ for the number of $n \times n$ magic squares with their entries being prime numbers in $[0,N]$. For every $n \ge 3$ we give appropriate systems of linear…

Number Theory · Mathematics 2012-07-18 Carlos Vinuesa

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

Combinatorics · Mathematics 2016-07-20 Vladimir Blinovsky , Catherine Greenhill

Let $R$ be a Noetherian ring and $x_1,\ldots,x_t$ a permutable regular sequence of elements in $R$. Then there exists a finite set of primes $\Lambda$ and natural number $C$ so that for all $n_1,\ldots,n_t$ there exists a primary…

Commutative Algebra · Mathematics 2023-01-09 Thomas Polstra

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

Functional Analysis · Mathematics 2019-12-16 Nacib Gurgel Albuquerque , Lisiane Rezende

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

Number Theory · Mathematics 2020-08-04 Robert Tichy , Ingrid Vukusic , Daodao Yang , Volker Ziegler

We give a self-contained proof that for all positive integers $r$ and all $\epsilon > 0$, there is an integer $N = N(r, \epsilon)$ such that for all $n \ge N$ any regular multigraph of order $2n$ with multiplicity at most $r$ and degree at…

Combinatorics · Mathematics 2010-10-26 E. R. Vaughan

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

Combinatorics · Mathematics 2011-01-27 Chris Dowden

We study the prime numbers that lie in Beatty sequences of the form $\lfloor \alpha n + \beta \rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev…

Number Theory · Mathematics 2019-09-04 Caleb Ji , Joshua Kazdan , Vaughan McDonald

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

Number Theory · Mathematics 2016-03-02 Quanli Shen

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

Number Theory · Mathematics 2026-05-20 Michael Harm

In this paper, we consider sums of three generalized $m$-gonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restrictions on $m$ modulo $30$, we show that a density one set of…

Number Theory · Mathematics 2024-09-23 Soumyarup Banerjee , Ben Kane , Daejun Kim

We study some notions of cohomology for asymptotically additive sequences and prove a Liv\v{s}ic-type result for almost additive sequences of potentials. As a consequence, we are able to characterize almost additive sequences based on their…

Dynamical Systems · Mathematics 2023-07-24 Carllos Eduardo Holanda , Eduardo Santana

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

Number Theory · Mathematics 2011-05-31 Giovanni Coppola

In a previous paper of the authors, we showed that for any polynomials $P_1,\dots,P_k \in \Z[\mathbf{m}]$ with $P_1(0)=\dots=P_k(0)$ and any subset $A$ of the primes in $[N] = \{1,\dots,N\}$ of relative density at least $\delta>0$, one can…

Number Theory · Mathematics 2014-10-13 Terence Tao , Tamar Ziegler

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

Number Theory · Mathematics 2014-02-26 Werner Georg Nowak , László Tóth

Let $r \geq 2$ be a fixed integer. For infinitely many $n$, let $\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple…

Combinatorics · Mathematics 2015-07-13 Vladimir Blinovsky , Catherine Greenhill

Mantel's Theorem asserts that a simple $n$ vertex graph with more than $\frac{1}{4}n^2$ edges has a triangle (three mutually adjacent vertices). Here we consider a rainbow variant of this problem. We prove that whenever $G_1, G_2, G_3$ are…