X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=fb89e5edc905cea8475fb2349b3318e4aad22947;hb=9dc3876d4313b1292111aa6ff56be168606fe9fd;hp=239f3e45b03a51adf0e772d967d48804f9cddf3a;hpb=d373c76a0ae0a1e7ba876d09359f84da40a7ea16;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 239f3e4..fb89e5e 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,14 +1,12 @@
-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. The EJA random element method only returns two summands by default.
\ No newline at end of file
+4. Conjecture: if x = (x1,x2), then det(x) = det(x1)det(x2). This
+   should be used to fix the fact that det(x) is monstrously slow in
+   Cartesian product algebras, and thus randomly in the doctests.