#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 | b0a04aa5a4454766ed9802d8e99abcd7fb3e105b
Dependencies: #17937 | Stopgaps:
-------------------------------------+-------------------------------------
Description changed by jdemeyer:
Old description:
> This fixes #17548.
New description:
This fixes #17548.
It also adds new features to `IntegerLists`:
1. Negative integers are allowed (but the default still is `min_part=0`).
2. There does not need to be a fixed sum, one can do for example
`IntegerLists(max_part=2)` for all lists of integers <= 2. One can also
give a lower/upper bound for the sum.
Note that the current implementation requires, for a given length, that
there are only finitely many lists of that length. This limitation could
be lifted in the future.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:38>
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.
