#17920: Reimplement IntegerLists using Polyhedron.integral_points()
-------------------------------------+-------------------------------------
Reporter: jdemeyer | Owner:
Type: enhancement | Status: needs_review
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jdemeyer/ticket/17920 | 5f81a0a08bed2dc5c73f8f99dd32deafdfb3c9a1
Dependencies: #17937 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Replying to [comment:54 nthiery]:
> By the way: we don't yet use Barvinok-like algorithms for counting
> (e.g. through LattE), or do we? This could make a difference too.
I just read the first paragraph of the LattE manual and it does
'''exactly''' what we need here:
{{{
1.1 What is LattE?
The name “LattE” is an abbreviation for “Lattice point Enumeration.” LattE
was developed in 2001 to count lattice points contained in convex
polyhedra
defined by linear equations and inequalities with integer coefficients.
The poly-
hedra can be of any (reasonably small) dimension.
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:55>
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/d/optout.
