X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=421e0e9450bd18bab8fc5b9f0c75c738df099080;hb=7c21799d680433b62d48ca79cc2ea8f27e1cd8da;hp=d7db05d092cf03ddf48a84bf4dab995578597122;hpb=2e96d7bbca8b654f79bc63b9cb09fe3ac6717ad4;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index d7db05d..421e0e9 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,16 +1,10 @@
-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. 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...
 
-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().
+4. Conjecture: if x = (x1,x2), then det(x) = det(x1)det(x2).