#10534: Optimizations for the generation of subwords, subsets and set partitions
---------------------------------------------------------------------+------
Reporter: vdelecroix |
Owner: vdelecroix
Type: enhancement |
Status: needs_review
Priority: major |
Milestone: sage-5.3
Component: combinatorics |
Resolution:
Keywords: generation, combinatorics, set, subset, partition | Work
issues:
Report Upstream: N/A |
Reviewers: Florent Hivert
Authors: Vincent Delecroix |
Merged in:
Dependencies: |
Stopgaps:
---------------------------------------------------------------------+------
Comment (by vdelecroix):
Replying to [comment:19 chapoton]:
> Here is a minimal example of what goes wrong in polytopes.parallelotope
:
>
> {{{
> sage: g=[ vector([1,0]), vector([0,1])]
> sage: Combinations(g)
> }}}
>
> This is a mutability/hash problem, when trying to convert a multiset in
a set, apparently..
In the above example, the command fails because the *vector* is not
hashable.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10534#comment:20>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
