#6812: Enumerate integer vectors modulo to the action of a Permutation Group
------------------------------------------------------------------+---------
Reporter: nborie |
Owner: nborie
Type: enhancement |
Status: needs_work
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: #10334, #10335 |
Stopgaps:
------------------------------------------------------------------+---------
Comment (by SimonKing):
Replying to [comment:56 nborie]:
> I will propose a new version this week end and the possible
ameliorations will be part of separate tickets. The use of Clonable
integer array is ok and fine because all is in Sage.
Great! And will the Cython stuff we discussed in Paris also be part of
that patch?
For the record: I finally re-implemented my algorithm for the computation
of fundamental invariants of non-modular invariant rings of finite groups
for the special case of permutation groups, using your implementation of
orbits. I should have done that earlier. After all, thanks to your work on
enumerating orbits, it will probably be a lot faster than my original
implementation in Singular (which dealt very inefficiently with orbits).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6812#comment:57>
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.
