اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFinding elliptic curves with a subgroup of prescribed size
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is divisible by m. The running time of the algorithm is mp^(1/2+o(1)), and this leads to more efficient constructions of rational functions over F_p whose image is small relative to p. We also give an unconditional version of the algorithm that works for almost all primes p, and give a probabilistic algorithm with subexponential time complexity.
قيم البحث
اقرأ أيضاً
An elliptic curve $E$ over $mathbb{Q}$ is said to be good if $N_{E}^{6}<max!left{ leftvert c_{4}^{3}rightvert ,c_{6}^{2}right} $ where $N_{E}$ is the conductor of $E$ and $c_{4}$ and $c_{6}$ are the invariants associated to a global minimal model of
$E$. In this article, we generalize Massers Theorem on the existence of infinitely many good elliptic curves with full $2$-torsion. Specifically, we prove via constructive methods that for each of the fifteen torsion subgroups $T$ allowed by Mazurs Torsion Theorem, there are infinitely many good elliptic curves $E$ with $E!left(mathbb{Q}right) _{text{tors}}cong T$.
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small height, curves
with many integral multiples of a point, curves with high multiples of a point integral, and over two hundred curves with more than one hundred integral points. In addition, a novel and complete classification of self-descriptive numbers is constructed by bounding the number of zeros such a number must contain.
We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q to efficie
ntly generate elliptic curves with nontrivial N-torsion by searching for affine points on X_1(N)(F_q), and we give a fast method for generating curves with (or without) a point of order 4N using X_1(2N).
Let G(A) be an AF-algebra given by periodic Bratteli diagram with the incidence matrix A in GL(n, Z). For a given polynomial p(x) in Z[x] we assign to G(A) a finite abelian group Z^n/p(A) Z^n. It is shown that if p(0)=1 or p(0)=-1 and Z[x]/(p(x)) is
a principal ideal domain, then Z^n/p(A) Z^n is an invariant of the strong stable isomorphism class of G(A). For n=2 and p(x)=x-1 we conjecture a formula linking values of the invariant and torsion subgroup of elliptic curves with complex multiplication.
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 elliptic curves over $mathbb Q$ and quadratic fields.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
