#17548: Partitions() is buggy
---------------------------------+---------------------------
Reporter: ferriszorro | Owner: ferriszorro
Type: defect | Status: needs_work
Priority: minor | Milestone: sage-6.5
Component: combinatorics | Resolution:
Keywords: Partitions | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps: #17637
---------------------------------+---------------------------
Comment (by tscrim):
Replying to [comment:29 jdemeyer]:
> > This is also not a bug because there are no other conditions on the
lists and each of these are the next in lex ordering.
>
> This is a bug! An iterator (finite or infinite) must eventually return
every element of the set.
It does, but it is doing it by lex ordering, which is different than by
length-then-lex ordering. Its the same as doing a Cartesian product of
`{1,2} x NN` and getting `[1, 0]`, `[1, 1]`, `[1, 2]`, ... Is that a bug
to you then too?
--
Ticket URL: <http://trac.sagemath.org/ticket/17548#comment:30>
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.
