#8442: Lie Methods and Related Combinatorics (tutorial)
--------------------------------------------+-------------------------------
Reporter: bump | Owner: bump
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.6.1
Component: documentation | Keywords:
Author: Daniel Bump | Upstream: N/A
Reviewer: Minh Van Nguyen, Mark Jordan | Merged:
Work_issues: |
--------------------------------------------+-------------------------------
Changes (by dimpase):
* status: needs_review => needs_info
Comment:
I'd like to give it a positive review, but I still might like to
know more about few related things:
One is about a way to connecting Lie functionality in GAP to the one in
Sage. Anything on this?
It would also be good if anything is said regarding the optional Sage
package lie (by Marc van Leeuween). Is it right that basically anything
doable in lie can be done in Sage?
In particular, lie can compute decompositions of, say, a tensor product of
two representations into irreducibles. It's not clear to me whether one
can do this in Sage (without lie).
Dmitrii
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8442#comment:44>
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.
