#15389: An algorithm for enumerating elements of bounded height in number fields
-------------------------------------+-------------------------------------
Reporter: dkrumm | Owner: dkrumm
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.13
Component: number theory | Resolution:
Keywords: sage-days55 | Merged in:
Authors: David Krumm, John | Reviewers:
Doyle | Work issues:
Report Upstream: N/A | Commit:
Branch: | b81322cb555becf5b44cf6a8419dbaf737f8f4fd
u/jdoyle/bdd_height | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dkrumm):
Replying to [comment:4 vdelecroix]:
Thanks for all your comments! We're working on this. I was wondering if
you saw any places where using Cython would speed things up?
Regarding point 5: Unfortunately, RDF is often not precise enough for our
computations. The polytope we deal with will sometimes have vertices with
very small coordinates, so that RDF thinks they are 0, and then things go
wrong. Ideally, we would be able to create a polyhedron whose base ring is
a real field with any given precision, but as far as I know this is not
allowed by the Polyhedron constructor. This is why we first compute the
vertices of our polytope with high precision as floating point numbers and
then convert them to rational numbers for the polyhedron computation.
--
Ticket URL: <http://trac.sagemath.org/ticket/15389#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
