相关论文: Computing Modular Polynomials

We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

We calculate joint moments of the characteristic polynomial of a random unitary matrix from the circular unitary ensemble and its derivative in the case that the power in the moments is an odd positive integer. The calculations are carried…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

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…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

The modular curves in the family $X_1(N)$ for natural numbers $N$ parametrize elliptic curves over the complex numbers with a distinguished point of order $N$. The purpose of this paper is to better understand how to calculate the degrees…

Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

We provide an algorithmic method for constructing projective resolutions of modules over quotients of path algebras. This algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

Abstract. In this article, we provide an algorithm to compute the number of moduli of a germ of curve which is an union of germs of smooth curves in the complex plane.

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…

Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…

Given an elliptic curve $E$ and a finite Abelian group $G$, we consider the problem of counting the number of primes $p$ for which the group of points modulo $p$ is isomorphic to $G$. Under a certain conjecture concerning the distribution…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gr\"obner basis algorithms.