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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 45a9ac0..421e0e9 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,22 +1,10 @@
 1. Add references and start citing them.
 
-2. Pre-cache charpoly for some more algebras.
+2. Profile (and fix?) any remaining slow operations.
 
-3. Profile the construction of "large" matrix algebras (like the
-   15-dimensional QuaternionHermitianAlgebra(3)) to find out why
-   they're so slow.
+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...
 
-4. What the ever-loving fuck is this shit?
-
-       sage: O = Octonions(QQ)
-       sage: e0 = O.monomial(0)
-       sage: e0*[[[[]]]]
-       [[[[]]]]*e0
-
-5. Every once in a long while, the test
-
-       sage: set_random_seed()
-       sage: x = random_eja().random_element()
-       sage: x.is_invertible() == (x.det() != 0)
-
-   in eja_element.py returns False.
+4. Conjecture: if x = (x1,x2), then det(x) = det(x1)det(x2).