#12141: Implement finite algebras
--------------------------------------------------------------+-------------
Reporter: johanbosman | Owner:
AlexGhitza
Type: enhancement | Status:
needs_work
Priority: major | Milestone:
sage-5.11
Component: algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Johan Bosman, Peter Bruin, Michiel Kosters | Merged in:
Dependencies: | Stopgaps:
--------------------------------------------------------------+-------------
Changes (by johanbosman):
* status: needs_review => needs_work
Comment:
I haven't tested any of this yet, but in the code there seem to be a few
things that could be improved:
* Checking associativity is time-consuming. Since most algebras we'll be
applying this to are associative anyway, it may be wise to be able to set
a flag indicating the algebra is associative without explicit
verification.
* Validity check for homomorphisms seems not very fast either. Code that
constructs homomorphisms, like `quotient_map`, can probably be sped up by
putting `check=False` in there.
* Does primary decomposition depend on assumptions like associativity and
commutativity? Perhaps an error should be raised if these conditions
aren't met. Also check this for other functions.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12141#comment:12>
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/groups/opt_out.
