Related papers: Complex Multiplication Tests for Elliptic Curves
For a prime number p, we characterize the groups that may arise as torsion subgroups of an elliptic curve with complex multiplication defined over a number field of degree 2p. In particular, our work shows that a classification in the…
We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…
We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…
We prove useful necessary and sufficient conditions for an elliptic curve over a number field to admit a surjective adelic Galois representation. Using these conditions, we compute an example of a number field K and an elliptic curve E/K…
We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…
Let F be the cyclotomic field of fifth roots of unity. We computationally investigate modularity of elliptic curves over F.
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
Several problems which could be thought of as belonging to recreational mathematics are described. They are all such that solutions to the problem depend on finding rational points on elliptic curves. Many of the problems considered lead to…
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve E with complex multiplication. We analyse the intersections of elements of the arrangement and their connected components as…
We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
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…
We present experimental evidence to support the widely held belief that one half of all elliptic curves have infinitely many rational points. The method used to gather this evidence is a refinement of an algorithm due to the author which is…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…
We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.