Repository logo
  • English
  • Italiano
  • Log In
    Have you forgotten your password?
Repository logo
Repository logo
  • Archive
  • Series/Journals
  • EUT
  • Events
  • Statistics
  • English
  • Italiano
  • Log In
    Have you forgotten your password?
  1. Home
  2. EUT Edizioni Università di Trieste
  3. Periodici
  4. Rendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematics
  5. Rendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematics vol.48 (2016)
  6. On elliptic curves of bounded degree:a polarized Abelian surface
 
  • Details
  • Metrics
Options

On elliptic curves of bounded degree:a polarized Abelian surface

Guerra, Lucio
2016
Loading...
Thumbnail Image
ISSN
0049-4704
DOI
10.13137/2464-8728/13169
http://hdl.handle.net/10077/13169
  • Article

e-ISSN
2464-8728
Abstract
For a polarized compleax Abelian surface A we study the function NA(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of an explicit Diophantine equation, and we show that computing the number of solutions is reduced to the classical problem in Number Theory of counting lattice points lying on an explicit bounded subset of Euclidean space. We obtain in this way some asymptotic estimate for the counting function.
Series
Rendiconti dell'Istituto di matematica dell'Università di Trieste: an International Journal of Mathematics
48 (2016)
Subjects
  • Elliptic curve

  • Abelian surface

  • polarization

  • lattice points

Publisher
EUT Edizioni Università di Trieste
Licence
http://creativecommons.org/licenses/by-nc-nd/4.0/
File(s)
Loading...
Thumbnail Image
Download
Name

23_RIMUT48.pdf

Format

Adobe PDF

Size

1.49 MB

Indexed by

 Info

Open Access Policy

Share/Save

 Contacts

EUT Edizioni Università di Trieste

OpenstarTs

 Link

Wiki OpenAcces

Archivio Ricerca ArTS

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback