arXiv:2301.05044 [math.NT]AbstractReferencesReviewsResources
On almost-prime $k$-tuples
Published 2023-01-12Version 1
Let $\tau$ denote the divisor function and $\mathcal{H}=\{h_{1},...,h_{k}\}$ be an admissible set. We prove that there are infinitely many $n$ for which the product $\prod_{i=1}^{k}(n+h_{i})$ is square-free and $\sum_{i=1}^{k}\tau(n+h_{i})\leq \lfloor \rho_{k}\rfloor$, where $\rho_{k}$ is asymptotic to $\frac{2126}{2853} k^{2}$. It improves a previous result of M. Ram Murty and A. Vatwani, replacing $2126/2853$ by $3/4$. The main ingredients in our proof are the higher rank Selberg sieve and Irving-Wu-Xi estimate for the divisor function in arithmetic progressions to smooth moduli.
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1205.4610 [math.NT] (Published 2012-05-21)
Almost-prime $k$-tuples
arXiv:1205.5020 [math.NT] (Published 2012-05-22)
Bounded length intervals containing two primes and an almost-prime
arXiv:1711.05924 [math.NT] (Published 2017-11-16)
Improving an inequality for the divisor function