相关论文: Computing Modular Polynomials

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

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 present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…

Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…

In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…

Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…

The classical modular polynomials $\Phi_\ell(X,Y)$ give plane curve models for the modular curves $X_0(\ell)/\mathbb{Q}$ and have been extensively studied. In this article, we provide closed formulas for $\ell$ nontrivial coefficients of…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Let $E$ be an elliptic curve over a finite field $k$, and $\ell$ a prime number different from the characteristic of $k$. In this paper we consider the problem of finding the structure of the Tate module $T_\ell(E)$ as an integral Galois…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

In this article, we study the cyclicity problem of elliptic curves $E/\Bbb{Q}$ modulo primes in a given arithmetic progression. We extend the recent work of Akbal and G\"ulo\u{g}lu by proving an unconditional asymptotic for such a cyclicity…

In this paper we present a method which, given a singular point $(j_1, j_2)$ on $Y_0(\ell)$ with $j_1, j_2 \neq 0, 1728$ and an elliptic curve $E$ with $j$-invariant ${j_1}$, returns an elliptic curve $\widetilde{E}$ with $j$-invariant…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that for $P = (x:y:z)$ on an elliptic curve in Weierstrass form over an arbitrary ring we have $nP =…

In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…

We determine all possible degrees of cyclic isogenies of non-CM elliptic curves with rational $j$-invariant over number fields of degree $p$, where $p$ is an odd prime. The question had been answered for $p=2$, so this paper completes the…

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…