Related papers: On the Counting Function of Elliptic Carmichael Nu…
We prove that every arithmetic progression either contains infinitely many Carmichael numbers or none at all. Furthermore, there is a simple criterion for determining which category a given arithmetic progression falls into. In particular,…
Let K be a number field and let E/K be an elliptic curve. If E has complex multiplication, we show that there is a positive lower bound for the canonical height of non-torsion points on E defined over the maximal abelian extension K^ab of…
In this paper we establish a number of new estimates concerning the prime counting function \pi(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in…
We study the elliptic maximal functions defined by averages over ellipses and rotated ellipses which are multi-parametric variants of the circular maximal function. We prove that those maximal functions are bounded on $L^p$ for some $p\neq…
We extend our previous computations to show that there are 585355 Carmichael numbers up to $10^{17}$. As before, the numbers were generated by a back-tracking search for possible prime factorisations together with a ``large prime…
Let $E/\mathbb{Q}(T)$ be a non-isotrivial elliptic curve of rank $r$. A theorem due to Silverman implies that the rank $r_t$ of the specialization $E_t/\mathbb{Q}$ is at least $r$ for all but finitely many $t \in \mathbb{Q}$. Moreover, it…
In this article, we give upper bounds for cyclotomic numbers of order e over a finite field with q elements, where e is a divisor of q-1. In particular, we show that under certain assumptions, cyclotomic numbers are at most…
This study utilizes Orlicz functions to provide refined lower and upper bounds on the q-numerical radius of an operator acting on a Hilbert space. Additionally, the concept of q-sectorial matrices is introduced and further bounds for the…
By using some deep tools from microlocal analysis, the authors of the papers (Ann. of Math., 165 (2007), 567--591, J. Amer. Math. Soc., 23 (2010), 655--691; Invent. Math., 178 (2009), 119--171; Duke Math. J., 158(2011), 83--120) have…
We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.
We prove a Carleman estimate for elliptic second order partial differential operators with Lipschitz continuous coefficients. The Carleman estimate is valid for any complex-valued function $u\in W^{2,2}$ with support in a punctured ball of…
We establish an explicit lower bound for the N\'eron-Tate height on elliptic curves with complex multiplication, for nontorsion points defined over the maximal abelian extension of a number field. Building on a strategy developed by…
Let E/k be an elliptic curve over a number field. We obtain some quantitative refinements of results of Hindry-Silverman, giving an upper bound for the number of k-rational torsion points, and a lower bound for the canonical height of…
We extend our previous computations to show that there are 246683 Carmichael numbers up to $10^{16}$. As before, the numbers were generated by a back-tracking search for possible prime factorisations together with a ``large prime…
Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see \cite{LP}). We improve the lower bound and provide a heuristic argument which…
We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…
We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.
We give explicit upper and lower bounds on the size of the coefficients of the modular polynomials $\Phi_N$ for the elliptic $j$-function. These bounds make explicit the best previously known asymptotic bounds. We then give an explicit…