Related papers: On the evaluation of modular polynomials

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo…

Let F be the cyclotomic field of fifth roots of unity. We computationally investigate modularity of elliptic curves over F.

It is shown in "SIAM J. Sci. Comput. 39 (2017):B424-B441" that free-form curves used in computer aided geometric design can usually be represented as the solutions of linear differential systems and points and derivatives on the curves can…

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…

We compute the first murmurations for elliptic curves over function fields F_q(t): oscillatory patterns in average Frobenius traces that separate rank-0 from rank-1 curves, with z-scores up to 256. For the family E_D: y^2 = x^3 + x + D(t)…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

An isogeny class of elliptic curves over a finite field is determined by a quadratic Weil polynomial. Gekeler has given a product formula, in terms of congruence considerations involving that polynomial, for the size of such an isogeny…

There is a modular curve X'(6) of level 6 defined over Q whose Q-rational points correspond to j-invariants of elliptic curves E over Q for which Q(E[2]) is a subfield of Q(E[3]). In this note we characterize the j-invariants of elliptic…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…

Given two elliptic curves $E_1$ and $E_2$ defined over the field of rational numbers, $\mathbb{Q}$, with good reduction at an odd prime $p$ and equivalent mod $p$ Galois representation, we compare the $p$-Selmer rank, global and local root…

Let $E$ be an elliptic curve over $\F_p$ without complex multiplication, and for each prime $p$ of good reduction, let $n_E(p) = | E(\F_p) |$. Let $Q_{E,b}(x)$ be the number of primes $p \leq x$ such that $b^{n_E(p)} \equiv b\,({\rm…

We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of…