Skip to main content
SpringerLink
Log in
Book cover

International Algorithmic Number Theory Symposium

ANTS 1994: Algorithmic Number Theory pp 41Cite as

Computing rates of growth of division fields on CM Abelian varieties

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 877))

Abstract

We report on algorithmic aspects of the problem of explicitly computing the rate of growth of the field of N k-th division points on an n-dimensional simple Abelian variety with Complex Multiplication. Two new examples are discussed.

This is a preview of subscription content, log in via an institution.

Author information

Authors and Affiliations

  1. Department of Mathematics, Lehigh University, 18015, Bethlehem, PA

    Bruce A. Dodson & Matthew J. Haines

Authors
  1. Bruce A. Dodson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew J. Haines
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leonard M. Adleman Ming-Deh Huang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dodson, B.A., Haines, M.J. (1994). Computing rates of growth of division fields on CM Abelian varieties. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-58691-1_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58691-3

  • Online ISBN: 978-3-540-49044-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation