HMHamed Mousavi
Hamed Mousavi
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hamed Mousavi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michael T. Lacey
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
4 shared publications - Yaghoub Rahimi
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
4 shared publications - Christina Giannitsi
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
3 shared publications - Maxie Dion Schmidt
School of Mathematics Georgia Institute of Technology
2 shared publications - Ben Krause
Department of Mathematics, King's College London, WC2R 2LS, UK
1 shared publication
Latest Publications
- Open Access
Averages over the Gaussian Primes: Goldbach's Conjecture and Improving Estimates
We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $ω\subset \mathbb{T}$. There is an integer $N_ω$, so that every odd integer $n$ with $N(n)>N_ω$ and $\text{dist}( \text{arg}(n) , \mathbb{T}\setminus ω) > (\log N(n)) ^{-B}$, is a sum of three Gaussian primes $n=p_1+p_2+p_3$, with $\text{arg}(p_j) \in ω$, for $j=1,2,3$. A density version of the binary Goldbach conjecture in a sector is also proved.Open AccessAverages over the Gaussian Primes: Goldbach's Conjecture and Improving Estimates
We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $ω\subset \mathbb{T}$. There is an integer $N_ω$, so that every odd integer $n$ with $N(n)>N_ω$ and $\text{dist}( \text{arg}(n) , \mathbb{T}\setminus ω) > (\log N(n)) ^{-B}$, is a sum of three Gaussian primes $n=p_1+p_2+p_3$, with $\text{arg}(p_j) \in ω$, for $j=1,2,3$. A density version of the binary Goldbach conjecture in a sector is also proved. - 2 June 2022
- Published by Springer Nature in Banach Journal of Mathematical Analysis
- Vol. 16 (3) , 1-25
Improving and maximal inequalities for primes in progressions
- 2 June 2022
- Published by Springer Nature in Banach Journal of Mathematical Analysis
- Vol. 16 (3) , 1-25
Improving and maximal inequalities for primes in progressions
- Open Access
Improving and Maximal Inequalities for Primes in Progressions
Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv b\pmod{y}}} \Lambda (n) f(x-n) \end{align*} Above, $\Lambda $ is the von Mangoldt function and $\phi $ is the totient function. We establish improving and maximal inequalities for these averages. These bounds are uniform in the choice of progression. For instance, for $ 1< r < \infty $ there is an integer $N _{y, r}$ so that \begin{align*} \lVert \sup _{N>N _{y,r}} \lvert A_{N,y,b} f \rvert \rVert_{r}\ll \lVert f\rVert_{r}. \end{align*} The implied constant is only a function of $ r$. The uniformity over progressions imposes several novel elements on the proof.Open AccessImproving and Maximal Inequalities for Primes in Progressions
Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv b\pmod{y}}} \Lambda (n) f(x-n) \end{align*} Above, $\Lambda $ is the von Mangoldt function and $\phi $ is the totient function. We establish improving and maximal inequalities for these averages. These bounds are uniform in the choice of progression. For instance, for $ 1< r < \infty $ there is an integer $N _{y, r}$ so that \begin{align*} \lVert \sup _{N>N _{y,r}} \lvert A_{N,y,b} f \rvert \rVert_{r}\ll \lVert f\rVert_{r}. \end{align*} The implied constant is only a function of $ r$. The uniformity over progressions imposes several novel elements on the proof. - 1 January 2022
- Published by International Press of Boston in Mathematical Research Letters
- Vol. 29 (6) , 1767-1791
Endpoint $\ell^r$ improving estimates for prime averagesInternational Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2022
- Published by International Press of Boston in Mathematical Research Letters
- Vol. 29 (6) , 1767-1791
Endpoint $\ell^r$ improving estimates for prime averagesInternational Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 20 October 2020
- Published by Springer Nature in The Ramanujan Journal
- Vol. 54 (2) , 309-341
Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums
- 20 October 2020
- Published by Springer Nature in The Ramanujan Journal
- Vol. 54 (2) , 309-341
Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums
- Open Access
Factorization Theorems for Relatively Prime Divisor Sums, GCD Sums and Generalized Ramanujan Sums
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude the last section of the article by directly expanding new formulas for an arithmetic function $g$ by the type II sums using discrete Fourier transforms for functions over inputs of greatest common divisors and by suitably defined orthogonal polynomial sequences whose weight function we can define by a discrete time Fourier transform (DTFT) involving the partition function $p(n)$. There are numerous applications and special cases of our new results which we are able to cite as examples in the article. Particular cases of the applications we give in the article include new identities for Euler's totient function, the Ramanujan sums $c_q(n)$, the generalized sum-of-divisors functions, the Mertens function which is the summatory function of the M\"obius function, and the cyclotomic polynomials.Open AccessFactorization Theorems for Relatively Prime Divisor Sums, GCD Sums and Generalized Ramanujan Sums
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude the last section of the article by directly expanding new formulas for an arithmetic function $g$ by the type II sums using discrete Fourier transforms for functions over inputs of greatest common divisors and by suitably defined orthogonal polynomial sequences whose weight function we can define by a discrete time Fourier transform (DTFT) involving the partition function $p(n)$. There are numerous applications and special cases of our new results which we are able to cite as examples in the article. Particular cases of the applications we give in the article include new identities for Euler's totient function, the Ramanujan sums $c_q(n)$, the generalized sum-of-divisors functions, the Mertens function which is the summatory function of the M\"obius function, and the cyclotomic polynomials.