LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Computational algorithm for reduction type of CM abelian varieties

Photo from wikipedia

Abstract Let A be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number p. Denote A as an abelian variety… Click to show full abstract

Abstract Let A be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number p. Denote A as an abelian variety over a finite field of characteristic p, which is obtained by the reduction of A at the prime ideal. In this study, we derive an algorithm that allows us to decompose the group scheme A [ p ] into indecomposable quasi-polarized BT 1 -group schemes up to isomorphism. This can be achieved for the unramified p based on its decomposition into prime ideals in the endomorphism algebra of A. We also compute all types of these correspondences for abelian varieties with dimensions up to 5. As a consequence, we establish the relationship between the decompositions of prime p and the corresponding pairs of p-rank and a-number for an abelian variety A.

Keywords: reduction; reduction type; computational algorithm; abelian varieties; abelian variety; algorithm reduction

Journal Title: Journal of Algebra
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.