Papers
Topics
Authors
Recent
Search
2000 character limit reached

On almost-prime $k$-tuples

Published 12 Jan 2023 in math.NT | (2301.05044v1)

Abstract: 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.