Related papers: On the evaluation of modular polynomials

Let $\ell$ be a prime number and let $E$ and $E'$ be $\ell$-isogenous elliptic curves defined over a finite field $k$ of characteristic $p \ne \ell$. Suppose the groups $E(k)$ and $E'(k)$ are isomorphic, but $E(K) \not \simeq E'(K)$, where…

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…

In this paper we generalize the $j$-invariant criterion for the semistable reduction type of an elliptic curve to superelliptic curves $X$ given by $y^{n}=f(x)$. We first define a set of tropical invariants for $f(x)$ using symmetrized…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

We show there exist polynomial bounds on torsion of elliptic curves which come from a fixed geometric isogeny class. More precisely, for an elliptic curve $E_0$ defined over a number field $F_0$, for each $\epsilon>0$ there exist constants…

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral…

In this paper we determine the quadratic points on the modular curves X_0(N), where the curve is non-hyperelliptic, the genus is 3, 4 or 5, and the Mordell--Weil group of J_0(N) is finite. The values of N are 34, 38, 42, 44, 45, 51, 52, 54,…

Suppose $\ell$ is a prime number, ${\mathbf Q}_\ell$ is the field of $\ell$-adic numbers, ${\mathbf F}_\ell$ is the finite field of $\ell$ elements, and $d$ is a positive integer. Suppose $G$ is a finite subgroup of a symplectic group…

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

In this paper we give a module-theoretic description of the isomorphism classes of abelian varieties $A$ isogenous to $B^r$, where the characteristic polynomial $g$ of Frobenius of $B$ is an ordinary square-free $q$-Weil polynomial, for a…

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…