Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInvariants of stationary AF-algebras and torsion subgroup of elliptic curves with complex multiplication
129
0
0.0
(
0
)
Authors
Igor Nikolaev
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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$.
For every normalized newform f in S_2(Gamma_1(N)) with complex multiplication, we study the modular parametrizations of elliptic curves C from the abelian variety A_f. We apply the results obtained when C is Grosss elliptic curve A(p).
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes, including the largest prime currently known whose primality cannot feasibly be proved using classical methods.
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.
Let $C$ be a smooth, absolutely irreducible genus-$3$ curve over a number field $M$. Suppose that the Jacobian of $C$ has complex multiplication by a sextic CM-field $K$. Suppose further that $K$ contains no imaginary quadratic subfield. We give a bound on the primes $mathfrak{p}$ of $M$ such that the stable reduction of $C$ at $mathfrak{p}$ contains three irreducible components of genus $1$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
