X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=6223bff9331ba3144cbfdd8fbdd8fe616139a230;hb=78c5efcc7d5274e0bfb76db90b7ba0b2d8ac36a0;hp=38aa85bfe7a5c5ecc4b97c880c05533e42b5ad69;hpb=09298a6b80a44847f506961e0eeccb8cdf2ad9d3;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 38aa85b..6223bff 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,22 +1,15 @@
-A. Add tests for orthogonality in the Peirce decomposition.
+1. Add references and start citing them.
 
-B. Add support for a symmetric positive-definite bilinear form in
-   the JordanSpinEJA.
+2. Profile (and fix?) any remaining slow operations.
 
-1. Add CartesianProductEJA.
+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...
 
-2. Check the axioms in the constructor when check != False?
+4. Can we hit "x" with the deortho matrix and delegate to the
+   _rational_algebra to speed up minimal_polynomial?
 
-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().
-
-7. Solve the charpoly system with A_of_x.solve_right(x_powers[r])
-   rather than dumbass Cramer's rule.
+5. In CartesianProductEJA we already know the multiplication table and
+   inner product matrix. Refactor things until it's no longer
+   necessary to duplicate that work.