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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 382fb6e..38cff88 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,17 +1,8 @@
-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.
-
-4. Implement the octonion simple EJA.
-
-5. Factor out the Jordan axiom and norm tests once all of the
-   algebras pass.
-
-6. Create Element subclasses for the matrix EJAs, and then override
-   their characteristic_polynomial() method to create a new algebra
-   over the rationals (with a non-normalized basis). We can then
-   compute the charpoly quickly by passing the natural representation
-   of the given element into the new algebra and computing its charpoly
-   there. (Relies on the theory to ensure that the charpolys are equal.)
\ No newline at end of file
+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...