#17979: Reimplementation of IntegerListsLex
-------------------------------------+-------------------------------------
Reporter: aschilling | Owner:
Type: defect | Status: needs_work
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: days64 | Merged in:
Authors: Bryan Gillespie, | Reviewers: Nathann Cohen, Jeroen
Anne Schilling, Nicolas M. Thiery | Demeyer
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/17979 | f73c43fd4423675f9ce279da9bb929a44db31483
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Replying to [comment:194 nthiery]:
> As a separate question: do you believe like me that we should, in a
> later ticket, get rid of this "feature"?
I do think that, by default, we shouldn't output lists with trailing
zeros, since this will lead in many cases to infinitely many lists
satisfying the constraints. However, I think it's best if the behaviour of
`__contains__` really matches the iterator.
If you ever allow negative parts, then the convention of having no
trailing zeros becomes very strange, since "non-zero" is no longer a
convex condition.
In #17920 I solved this by setting a minimum/maximum value for the last
part of a list, if the list is longer than `min_length`. By default, this
minimum is 1 with no maximum which gives the same lists as the "identify
trailing zeros" convention.
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:197>
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.
