#17979: Reimplementation of IntegerListsLex
-------------------------------------+-------------------------------------
Reporter: aschilling | Owner:
Type: defect | Status: needs_review
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 | eda24717a8e942ec25bde17fe0d8a710d0846d28
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by aschilling):
Replying to [comment:469 nthiery]:
> Replying to [comment:466 ncohen]:
> > The asymptotic complexity is not the only thing I had in mind when I
pointed toward that book.
>
> Yes, I know! Same for me.
>
> > For things as easy to enumerate as integer partitions (wiht min/max
> > n, min/max part, min/max length) I believe that we should have
> > Cython implementation (no Python needed). When called at C level,
> > it would be infinitely faster to enumerate and filter permutations
> > satisfying a given predicate. It also couldn't hurt if
> > `IntegerListsLex` relied on it in thos simple cases.
>
> In summary, the plan is:
>
> - Correct implementation of IntegerListsLex (this ticket)
> - Asymptotically good implementation (#18055)
FYI, Bryan and I talked about the algorithm for #18055 yesterday at
Berkeley!
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:470>
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.
