Mayank Pandey

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.NT2023

Numbers with at most $2$ prime factors in short arithmetic progressions

Mayank Pandey

We show that if $\frac{L}{φ ( q ) l o g X} \to \infty$ as $X \to \infty$ , almost all $(a, x) \in (Z / q Z)^{\times} \times [X, 2 X]$ are such that there exists a product of at most…

math.NT2023

$L^{1}$ means of exponential sums with multiplicative coefficients. I

Mayank Pandey, Maksym Radziwiłł

We show that the $L^{1}$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or Möbius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}…

math.NT2016★ 2 cited

On Eisenstein primes

Mayank Pandey

In this paper, we prove that there are infinitely many primes of the form $ℓ^{2} - ℓ m + m^{2}$ such that $2 ℓ - m$ is also prime. To prove this, we follow along the lines of t…

Numbers with at most 2 prime factors in short arithmetic progressions

L1 means of exponential sums with multiplicative coefficients. I

On Eisenstein primes

Numbers with at most $2$ prime factors in short arithmetic progressions

$L^{1}$ means of exponential sums with multiplicative coefficients. I