Quantitative results of the Romanov type representation functions

DOI10.1093/QMATH/HAAD022MaRDI QIDQ6183306zbMATH OpenOpenAlexFDO

Authors Yonggao Chen, Yuchen Ding

Publication date 26 January 2024

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2204.12287

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Additive bases, including sumsets (11B13) Goldbach-type theorems; other additive questions involving primes (11P32)

Abstract: For $alpha>0$, let ${\displaystyle }$mathscr{A}={ a_1<a_2<a_3<cdots}${\displaystyle }$ and ${\displaystyle }$mathscr{L}={ ell_1, ell_2, ell_3,cdots} quad ext{(not~necessarily~different)}${\displaystyle }$ be two sequences of positive integers with $mathscrA(m)>(logm{)}^{a}lpha$ for infinitely many positive integers $m$ and $el{l}_m<0.9loglogm$ for sufficiently integers $m$. Suppose further that $(el{l}_i,a_i)=1$ for all $i$. For any $n$, let $f_{mathscrA,mathscrL}(n)$ be the number of the available representations listed below ${\displaystyle }$ell_in=p+a_i quad left(1le ile mathscr{A}(n) ight),${\displaystyle }$ where $p$ is a prime number. It is proved that ${\displaystyle }$limsup_{n o infty } frac{f_{mathscr{A},mathscr{L}}(n)}{loglog n}>0,${\displaystyle }$ which covers an old result of ErdH os in 1950 by taking $a_i=2^i$ and $el{l}_i=1$. One key ingredient in the argument is a technical lemma established here which illustrates how to pick out the admissible parts of an arbitrarily given set of distinct linear functions. The proof then reduces to the verifications of a hypothesis involving well--distributed sets introduced by Maynard, which of course would be the other key ingredient in the argument.

Recommendations

• Extending an Erdős result on a Romanov type problem
• On a problem of Romanoff type
• Some results on additive number theory. V
• scientific article; zbMATH DE number 3179553
• On Romanov's constant

Cited in

(4)

• Some Applications of the Maynard–Tao Theorem
• Polynomial analogue of Erdős' extension of the Romanoff theorem
• Primes in tuples and Romanoff's theorem
• Short intervals for the Romanoff-type sumset

This page was built for publication: Quantitative results of the Romanov type representation functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183306)