#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, Travis Scrimshaw
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/17979 | 3a8f47a93266b82928539304ae21212e9885716f
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nthiery):
Replying to [comment:256 aschilling]:
> When IntegerListsLex is enumerable (i.e. the vectors can be iterated
over in inverse lex order), then the list is finite. We will explain this
in the code.
Oh, actually not quite. Sorry, my bad. I applied Koenig's lemma to
quick. The equivalence finite <=> inverse lexicographically enumerable
is almost true, except for extreme cases like:
{{{
sage: IntegerListsLex(n=1)
-> [1], [0,1], [0,0,1] ...
}}}
We will think about this a bit more and update the code accordingly.
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:257>
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.
