X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=5bb85879e781286ca67df0a37a856c7db0a7885d;hb=63d9a1be5861241fb7f02838a74589cf56c2548e;hp=89b4d329b76d848c0caf1528c1c78b7faec1ff9a;hpb=7996413ef05ab2275c2cbb86494e30241904914b;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 89b4d32..5bb8587 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,17 +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. Refactor the current ungodly fast charpoly hack (relies on the
-   theory to ensure that the charpolys are equal.)
-
-7. Implement random_instance() for the main EJA class.
-
-8. Implement random_instance() for the subalgebra class.
+4. Can we hit "x" with the deortho matrix and delegate to the
+   _rational_algebra to speed up minimal_polynomial?