X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=38cff88c1584b5be8c6a6ce7e90a47b8350adce3;hb=2eead94218aad1f63faec9cdeacc30171a880438;hp=a9158127e857ccea2b430dc60d91a0465b010480;hpb=0d2f419ecd30a2d7899a37ab38ae6b4ff0e3245e;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index a915812..38cff88 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,18 +1,8 @@
-0. Add tests for orthogonality in the Peirce decomposition.
+1. Add references and start citing them.
 
-1. Add CartesianProductEJA.
+2. Profile (and fix?) any remaining slow operations.
 
-2. Check the axioms in the constructor when check != False?
-
-3. Add references and start citing them.
-
-4. Implement the octonion simple EJA.
-
-5. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
-
-6. Can we make the minimal and characteristic polynomial tests work
-   for trivial algebras, too? Then we wouldn't need the "nontrivial"
-   argument to random_eja(). This would also allow us to potentially
-   pass a "size" of zero to the other constructors in random_eja() --
-   a code path that is basically untested right now.
+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...