SearcharxivSearch

arXiv subjects

Sumit Giri

Publications and source records attributed to Sumit Giri.

5 recordsLinked to original sources

Short average distribution of a prime counting function over families of elliptic curves

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and let $N$ be a positive integer. Now, $M_E(N)$ counts the number of primes $p$ such that the group $E_p(\mathbb{F}_p)$ is of order $N$. In an earlier joint work with Balasubramanian, we showed that $M_E(N)$ follows Poisson distribution when an average is taken over a family of elliptic curve with parameters $A$ and $B$ where $A,\, B\ge N^{\frac{\ell}{2}}(\log N)^{1+\gamma}$ and $AB>N^{\frac{3\ell}{2}}(\log N)^{2+\gamma}$ for a fixed integer $\ell$ and any $\gamma>0$. In this paper, we show that for sufficiently large $N$, the same result holds even if we take $A$ and $B$ in the range $\exp(N^{\frac{\epsilon^2}{20\ell}})\ge A, B>N^\epsilon$ and $AB>N^{\frac{3\ell}{2}}(\log N)^{6+\gamma}$ for any $\epsilon>0$.

math.NT

On correlations of certain multiplicative functions

In this paper, we study sums of shifted products $\sum\limits_{n \leq x} F(n) G(n-h)$ for any $|h| \leq x/2$ and arithmetic functions $F=f*1$ and $G=g*1$, with $f$ and $g$ small. We obtain asymptotic formula for different orders of magnitude of $f$ and $g$. We also provide asymptotic formula for sums of the type $\sum\limits_{n \leq x} \mu^2(n) G(n-h)$, where $G=g*1$ and $g$ is small. For small order of magnitudes of $f$ and $g$, we improve the error terms and make them independent of $h$.

math.NT

Mean-Value of Product of Shifted Multiplicative Functions and Average Number of Points on Elliptic Curves

In this paper, we consider the mean value of the product of two real valued multiplicative functions with shifted arguments. The functions $F$ and $G$ under consideration are close to two nicely behaved functions $A$ and $B$, such that the average value of $A(n-h)B(n)$ over any arithmetic progression is only dependent on the common difference of the progression. We use this method on the problem of finding mean value of $K(N)$, where $K(N)/\log N$ is the expected number of primes such that a random elliptic curve over rationals has $N$ points when reduced over those primes.

math.NT

On Additive Representation Functions

Let $\A=\{a_1<a_2<a_3.....<a_n<...\}$ be an infinite sequence of integers and let $R_2(n)=|\{(i,j):\ \ a_i+a_j=n;\ \ a_i,a_j\in \A;\ \ i\le j\}|$. We define $S_k=\s_{l=1}^k(R_2(2l)-R_2(2l+1))$. We prove that, if $L^{\infty}$ norm of $S_k^+(=\max\{S_k,0\})$ is small then $L^1$ norm of $\frac{S_k^+}{k}$ is large.

math.NT