Related papers: Complex Multiplication Tests for Elliptic Curves
Let $E$ be an elliptic curve over $\mathbb{Q}$. In this paper we study two certain modular curves which parameterize families of elliptic curves which are directly (resp. reverse) 6-congruent to $E$ together with the explicit…
This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…
Let $E:y^2=(x-e_1)(x-e_2)(x-e_3)$ be a nonconstant elliptic curve over $\mathbb{Q}(t)$, where $e_j\in \mathbb{Z}[t]$. We describe a method for finding a specialization $t\mapsto t_0\in\mathbb{Q}$ such that the specialization homomorphism is…
Let A be an abelian threefold defined over a number field K with potential multiplication by an imaginary quadratic field M. If A has signature (2,1) and the multiplication by M is defined over an at most quadratic extension, we attach to A…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all…
Several characterizations of complex ellipsoids among convex bodies in Cn, in terms of their sections and projections are proved. Characterizing complex symmetry in similar terms is an important tool.
The search for patterns in time series is a very common task when dealing with complex systems. This is usually accomplished by employing a complexity measure such as entropies and fractal dimensions. However, such measures usually only…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $K$ be a number field of degree four that is Galois over $\mathbb{Q}$. The goal of this article is to classify the different isomorphism types of $E(K)_{\text{tors}}$.
We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear system of equations derived from the so…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
We consider an elliptic curve over a dyadic field with additive, potentially good reduction. We study the finite Galois extension of the dyadic field generated by the three-torsion points of the elliptic curve. As an application, we give a…
We give a classification of the cuspidal automorphic representations attached to rational elliptic curves with a non-trivial torsion point of odd order. Such elliptic curves are parameterizable, and in this paper, we find the necessary and…
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…
We determine obstructedness or unobstructedness of (holomorphic) Poisson deformations of ruled surfaces over an elliptic curve.
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…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
In the present paper, we study the match test for extended regular expressions. We approach this NP-complete problem by introducing a novel variant of two-way multihead automata, which reveals that the complexity of the match test is…
Complex patterns generated by the time evolution of a one-dimensional digitalized coupled map lattice are quantitatively analyzed. A method for discerning complexity among the different patterns is implemented. The quantitative results…