I would like to know what people think of the idea of implementing a method for computing all numbers of bounded height in a given number field. The algorithm is described in the paper http://arxiv.org/pdf/1111.4963.pdf . Since uploading this paper to the arxiv I have had several requests for my code, so I thought it might be useful to include it in Sage.
-- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
