#6812: Enumerate integer vectors modulo to the action of a Permutation Group
------------------------------------------------------------------+---------
Reporter: nborie |
Owner: nborie
Type: enhancement |
Status: needs_review
Priority: major |
Milestone: sage-5.1
Component: combinatorics |
Resolution:
Keywords: enumeration, integer, list, permutation, group | Work
issues: long time tests, information about listing infinite sets
Report Upstream: N/A |
Reviewers: Karl-Dieter Crisman, Simon King
Authors: Nicolas Borie | Merged
in:
Dependencies: |
Stopgaps:
------------------------------------------------------------------+---------
Comment (by SimonKing):
Some more comments:
There should not only be a fast `ClonableIntArray.list()`, but also a fast
`ClonableIntArray.tuple()`: Sometimes, one needs a tuple, not a list, and
it
would be awkward and slow to first transfrom the clonable int array into a
list
and transform that into a tuple.
I think that could be done here, or do you prefer a different ticket?
You know that my application of your work would be: Compute non-modular
invariant rings of permutation groups. For that purpose, it would be good
if
clonable int arrays could be used to define exponent vectors of a
monomial. But
that should clearly be on a different ticket.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6812#comment:63>
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.
