X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=5bb85879e781286ca67df0a37a856c7db0a7885d;hb=ec0cbae9fc7a437c2632abfa6f76f1ce5ae45674;hp=b2495b59f3264e5d638a59f6630daa77214cdb50;hpb=49f266e16de87af712beb680570ff39e2ae87de4;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index b2495b5..5bb8587 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,19 +1,11 @@
-1. Add CartesianProductEJA.
+1. Add references and start citing them.
 
-2. Check the axioms in the constructor when check != False?
+2. Profile (and fix?) any remaining slow operations.
 
-3. Add references and start citing them.
+3. When we take a Cartesian product involving a trivial algebra, we
+   could easily cache the identity and charpoly coefficients using
+   the nontrivial factor. On the other hand, it's nice that we can
+   test out some alternate code paths...
 
-4. Implement the octonion simple EJA.
-
-5. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
-
-6. Implement spectral projector decomposition for EJA operators
-   using jordan_form() or eigenmatrix_right(). I suppose we can
-   ignore the problem of base rings for now and just let it crash
-   if we're not using AA as our base field.
-
-7. Do we really need to orthonormalize the basis in a subalgebra?
-   So long as we can decompose the operator (which is invariant
-   under changes of basis), who cares?
+4. Can we hit "x" with the deortho matrix and delegate to the
+   _rational_algebra to speed up minimal_polynomial?