相关论文: Efficiently computable endomorphisms for hyperelli…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
We show that for any elliptic curve (with j invariant not 0 or 1728) over any field of characteristic different from 2 and 3, there exists an hyperelliptic curve H of genus 5 with two independent maps to the given elliptic curve. We also…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
Given an elliptic curve ${\mathcal E}$ over a field $K$ it is a challenging problem to write down explicit elements of its endomorphism ring ${\rm End}({\mathcal E});$ the problem amounts to find all possible solutions to a functional…
We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier…
We explicitly construct a dynamically incoherent partially hyperbolic endomorphisms of $\mathbb{T}^2$ in the homotopy class of any linear expanding map with integer eigenvalues. These examples exhibit branching of centre curves along…
Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…
In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…
The elliptic coordinates are used to build a new families of 2D coordinate systems which are orthogonal and admits the separation of variables. The charts of characteristic curves are constructed for these systems and compared with…
This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…
We show that for a class of two-loop diagrams, the on-shell part of the integration-by-parts (IBP) relations correspond to exact meromorphic one-forms on algebraic curves. Since it is easy to find such exact meromorphic one-forms from…
We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
We consider models for genus one curves of degree 5, which arise in explicit 5-descent on elliptic curves. We prove a theorem on the existence of minimal models with the same invariants as the minimal model of the Jacobian elliptic curve…