#11111: More support for finite dimensional modules and algebras with basis
-------------------------------------+-------------------------------------
Reporter: nthiery | Owner: nthiery
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: categories | Resolution:
Keywords: | Merged in:
Authors: Florent Hivert, | Reviewers:
Franco Saliola, Nicolas M. Thiéry | Work issues:
Report Upstream: N/A | Commit:
Branch: | bac267e5c4558b56271e9f5bd24d8e514776b5bc
public/11111-more_support_for_finite_dimensional_modules_and_algebras_with_basis|
Stopgaps:
Dependencies: #10963, #8678 |
-------------------------------------+-------------------------------------
Comment (by virmaux):
I don't know if it is the proper place to report this bug but let's try as
it is relatde to morphisms of finite dimensional modules (and coercion
system). The following has been obtained on the t/11111 branch.
{{{
sage: A5 = SymmetricGroupAlgebra(QQ, 5)
sage: Z5 = A5.center()
sage: phi = Z5.module_morphism(on_basis=lambda i:
Z5.an_element()*Z5.basis()[i], codomain=Z5)
sage: a = list(Z5.basis())[3]
sage: a in phi.domain()
True
sage: phi(a)
}}}
and I get
[...]
{{{
445 TODO: make a better unit test once Modules().example()
is implemented
446 """
--> 447 from sage.structure.element import get_coercion_model
448 import operator
449 return get_coercion_model().bin_op(left, right,
operator.mul)
RuntimeError: maximum recursion depth exceeded while calling a Python
object
sage:
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/11111#comment:15>
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.
