Related papers: Explicit Bound for the Prime Ideal Theorem in Resi…
The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…
In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
This paper presents algorithms for calculating the quadratic character and the norms of prime ideals in the ring of integers of any quadratic field. The norms of prime ideals are obtained by means of a sieve algorithm using the quadratic…
We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…
We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…
Let $\rho$ f,$\lambda$ be the residual Galois representation attached to a newform f and a prime ideal $\lambda$ in the integer ring of its coefficient field. In this paper, we prove explicit bounds for the residue characteristic of the…
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
Let $K$ be an imaginary quadratic field and $\mathcal{O}_K$ be its ring of integers. Let $h_E$ be the Weber function on certain elliptic curve $E$ with complex multiplication by $\mathcal{O}_K$. We show that if $N$ ($>1$) is an integer…
Over the last 50 years a large number of effective exponential bounds on the first Chebyshev function $\vartheta(x)$ have been obtained. Specifically we shall be interested in effective exponential bounds of the form \[ |\vartheta(x)-x| < a…
Under ABC, Silverman showed that there are infinitely many non-Wieferich primes with respect to any (non-trivial) base $a$. Recently Srinivas and Subramani proved an analogous result over number fields with trivial class group. In the first…
We establish a conditional equivalence between quantitative unboundedness of the analytic rank of elliptic curves over $\mathbb Q$ and the existence of highly biased elliptic curve prime number races. We show that conditionally on a Riemann…
We derive a priori estimates for second order derivatives of solutions to a wide calss of fully nonlinear elliptic equations on Riemannian manifolds. The equations we consider naturally appear in geometric problems and other applications…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
Over an algebraically closed field of characteristic zero, we prove that the generic initial ideal with respect to the degree reverse lexicographic term order of a general rational or elliptic curve on quadrics is almost revlex. Following…
We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…