X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=5bb85879e781286ca67df0a37a856c7db0a7885d;hb=ec0cbae9fc7a437c2632abfa6f76f1ce5ae45674;hp=1def3d2e9fd8cf381ae743344ce670a13f226438;hpb=cc172fbdcd369542f90cf64e31611cf8698bc05a;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 1def3d2..5bb8587 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -2,19 +2,10 @@
 
 2. Profile (and fix?) any remaining slow operations.
 
-3. Every once in a long while, the test
+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...
 
-       sage: set_random_seed()
-       sage: x = random_eja().random_element()
-       sage: x.is_invertible() == (x.det() != 0)
-
-   in eja_element.py returns False. Example:
-
-       sage: J1 = ComplexHermitianEJA(2)
-       sage: J2 = TrivialEJA()
-       sage: J = cartesian_product([J1,J2])
-       sage: x = J.from_vector(vector(QQ, [-1, -1/2, -1/2, -1/2]))
-       sage: x.is_invertible()
-       True
-       sage: x.det()
-       0
+4. Can we hit "x" with the deortho matrix and delegate to the
+   _rational_algebra to speed up minimal_polynomial?