Related papers: Computing points on modular curves over finite fie…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on…

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

We prove that integral points can be effectively determined on all but finitely many modular curves, and on all but one modular curve of prime power level.

Let $p$ be a large prime, $\ell\geq 2$ be a positive integer, $m\geq 2$ be an integer relatively prime to $\ell$ and $P(x)\in\mathbb{F}_p[x]$ be a polynomial which is not a complete $\ell'$-th power for any $\ell'$ for which…

In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…

A generalized Mordell curve of degree $n \ge 3$ over $\bQ$ is the smooth projective model of the affine curve of the form $Az^2 = Bx^n + C$, where $A, B, C$ are nonzero integers. A generalized Fermat curve of signature $(n, n, n)$ with $n…

Bruin and Najman, Ozman and Siksek, and Box described all the quadratic points on the modular curves of genus $2\leq g(X_0(n)) \leq 5$. Since all the hyperelliptic curves $X_0(n)$ are of genus $\leq 5$ and as a curve can have infinitely…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

We determine all modular curves $X_0^+(N)$ that admit infinitely many cubic points over the rational field $\mathbb{Q}$.

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

We introduce several new methods to obtain upper bounds on the number of solutions of the congruences $f(x) \equiv y \pmod p$ and $f(x) \equiv y^2 \pmod p,$ with a prime $p$ and a polynomial $f$, where $(x,y)$ belongs to an arbitrary square…

We present several new algorithms to evaluate modular polynomials of level $\ell$ modulo a prime $p$ on an input $j$. More precisely, we introduce two new generic algorithms, sharing the following similarities: they are based on a CRT…

We bound the j-invariant of S-integral points on arbitrary modular curves over arbitrary fields, in terms of the congruence group defining the curve, assuming a certain Runge condition is satisfied by our objects. We then apply our bounds…

In this paper we study the geometry of the Severi varieties parametrizing curves on the rational ruled surface $\fn$. We compute the number of such curves through the appropriate number of fixed general points on $\fn$, and the number of…

Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…