Jump to content

Algorithmic Number Theory Symposium

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by ClueBot NG (talk | contribs) at 18:32, 14 February 2020 (Reverting possible vandalism by 168.213.255.19 to version by User87539319. Report False Positive? Thanks, ClueBot NG. (3699911) (Bot)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Algorithmic Number Theory Symposium (ANTS) is a biennial academic conference, first held in Cornell in 1994, constituting an international forum for the presentation of new research in computational number theory. They are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, arithmetic geometry, finite fields, and cryptography.

Selfridge Prize

In honour of the many contributions of John Selfridge to mathematics, the Number Theory Foundation has established a prize to be awarded to those individuals who have authored the best paper accepted for presentation at ANTS. The prize, called the Selfridge Prize, is awarded every two years in an even numbered year. The prize winner(s) receive a cash award and a certificate.

The prize winners and their papers selected by the ANTS Program Committee are:

Proceedings

Before ANTS X, the refereed Proceedings of ANTS were published in the Springer series Lecture Notes in Computer Science. The proceedings of ANTS X and XIII were published by Mathematical Sciences Publishers. The proceedings of ANTS XI and ANTS XII were published as a special issue of the London Mathematical Society Journal of Computation and Mathematics.

Conference information by year

References

  1. ^ Warner Bley; Robert Boltie (2006). Computation of locally free class groups. Vol. 4076. pp. 72–86. doi:10.1007/11792086_6. ISBN 978-3-540-36075-9. {{cite book}}: |journal= ignored (help)
  2. ^ Juliana Belding; Reinier Bröker; Andreas Enge; Kristin Lauter (2008). Computing Hilbert Class Polynomials. Vol. 5011. pp. 282–295. arXiv:0802.0979. doi:10.1007/978-3-540-79456-1_19. ISBN 978-3-540-79455-4. {{cite book}}: |journal= ignored (help)
  3. ^ John Voight (2010). Computing automorphic forms on Shimura curves over fields with arbitrary class number. Vol. 6197. pp. 357–37'. arXiv:1004.5340. doi:10.1007/978-3-642-14518-6_28. ISBN 978-3-642-14517-9. {{cite book}}: |journal= ignored (help)
  4. ^ Andrew Sutherland (2012). On the evaluation of modular polynomials. Vol. 1. pp. 531–555. arXiv:1202.3985. Bibcode:2012arXiv1202.3985S. doi:10.2140/obs.2013.1.531. {{cite book}}: |journal= ignored (help)
  5. ^ Tom Fisher, "Minimal models of 6-coverings of elliptic curves". LMS Journal of Computation and Mathematics. 17: 112–127. 2014. doi:10.1112/S1461157014000217.
  6. ^ Jan Steffen Müller; Michael Stoll (2016). "Computing Canonical Heights on Elliptic Curves in Quasi-Linear Time". LMS Journal of Computation and Mathematics. 19: 391–405. arXiv:1509.08748. doi:10.1112/S1461157016000139.
  7. ^ Michael Musty; Sam Schiavone; Jeroen Sijsling; John Voight (2019). A database of Belyi maps. Vol. 2. pp. 375–392. arXiv:1805.07751. doi:10.2140/obs.2019.2.375. {{cite book}}: |journal= ignored (help)