#15650: Permutations and symmetric group algebra: getting rid of 'mult' global
in
seminormal form
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: permutation, | Merged in:
sage-combinat, descent algebra, | Reviewers: Travis Scrimshaw
symmetric group, seminormal form | Work issues:
Authors: Darij Grinberg | Commit:
Report Upstream: N/A | 473853757fce07a9b6ee497f2821e7161ed8989c
Branch: | Stopgaps:
public/combinat/seminormal |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by tscrim):
Hey Darij,
Your changes LGTM.
We'd want it's own class so it can be a proper parent. Thus we could do
coercions and multiplications with that basis. Think like how Sym works,
but perhaps we wouldn't use the multiple realizations framework since
there is a natural basis (IMO, but I'm not anywhere close an expert in
this field).
Perhaps we should open up a follow-up ticket which does that, and follow
Andrew's favorite construction?
To both, do you think there is any more work to be done here?
--
Ticket URL: <http://trac.sagemath.org/ticket/15650#comment:27>
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.
