相关论文: An algorithm for computing the Weierstrass normal …
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
The formal group law of an elliptic curve has seen recent applications to computational algebraic geometry in the work of Couveignes to compute the order of an elliptic curve over finite fields of small characteristic. The purpose of this…
Analysis of the generalized Weierstrass-Enneper system includes the estimation of the degree of indeterminancy of the general analytic solution and the discussion of the boundary value problem. Several different procedures for constructing…
We give an algorithm for calculating the splitting type of the normal bundle of any rational monomial curve. The algorithm is obtained by reducing the calculus to a combinatorial problem and then by solving this problem.
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 construct unramified central simple algebras representing 2-torsion classes in the Brauer group of a hyperelliptic curve, and show that every 2-torsion class can be constructed this way when the curve has a rational Weierstrass point or…
A new approach has been recently developed to study the arithmetic of hyperelliptic curves $y^2=f(x)$ over local fields of odd residue characteristic via combinatorial data associated to the roots of $f$. Since its introduction, numerous…
We establish elliptic regularity for nonlinear inhomogeneous Cauchy-Riemann equations under minimal assumptions, and give a counterexample in a borderline case. In some cases where the inhomogeneous term has a separable factorization, the…
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
There is a lifting from a non-CM elliptic curve $E/\mathbb{Q}$ to a paramodular form $f$ of degree $2$ and weight $3$ given by the symmetric cube map. We find the level of $f$ in an explicit way in terms of the coefficients of the…
A plane cubic curve, defined over a field with valuation, is in honeycomb form if its tropicalization exhibits the standard hexagonal cycle. We explicitly compute such representations from a given j-invariant with negative valuation, we…
The study of alternative models for elliptic curves has found recent interest from cryptographic applications, once it was recognized that such models provide more efficiently computable algorithms for the group law than the standard…
The development of secure cryptographic protocols and the subsequent attack mechanisms have been placed in the literature with the utmost curiosity. While sophisticated quantum attacks bring a concern to the classical cryptographic…
In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
It is proved that the rank of an elliptic curve is one less the arithmetic complexity of the corresponding non-commutative torus. As an illustration, we consider a family of elliptic curves with complex multiplication.
Given a hyperelliptic curve $C$ of genus $g$ over a number field $K$ and a Weierstrass model $\mathscr{C}$ of $C$ over the ring of integers ${\mathcal O}_K$ (i.e. the hyperelliptic involution of $C$ extends to $\mathscr{C}$ and the quotient…
We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…