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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 38cff88..6223bff 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -6,3 +6,10 @@
    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. Can we hit "x" with the deortho matrix and delegate to the
+   _rational_algebra to speed up minimal_polynomial?
+
+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.