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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 5307527..fb89e5e 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -2,10 +2,11 @@
 
 2. Profile (and fix?) any remaining slow operations.
 
-3. 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.
+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. 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.