#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 nthiery):
Replying to [comment:65 SimonKing]:
> Out of interest, I am trying to use my algorithm to find fundamental
invariants for `TransitiveGroup(14,61)` over the rationals. The main
bottleneck is the reduction of orbit sums modulo the previously found
fundamental reductions (if the reduction is non-zero then the orbit sum is
a new fundamental invariant). For some orbit sums in degree 8, the
reduction takes several minutes!
Yup. That's the purpose of Nicolas's algorithm: to handle large groups by
avoiding such reductions.
Speaking of comparison of algorithms: we just got a Magma license to run
systematic benchmarks on our computation server in Orsay in the coming
months for Nicolas's paper. We should do this benchmark all together to
get the best of all systems/algorithms.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6812#comment:66>
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.
