X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=89b4d329b76d848c0caf1528c1c78b7faec1ff9a;hb=259d256fb765350eb6691efe1765c9f4e2a121bd;hp=67f390ba24f06e6d0f419609ddb8654afd0a65bf;hpb=33e3a4deff70731138dafc2857ba811b3c66f5b3;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 67f390b..89b4d32 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -9,9 +9,9 @@
 5. Factor out the unit-norm basis (and operator symmetry) 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
+6. Refactor the current ungodly fast charpoly hack (relies on the
+   theory to ensure that the charpolys are equal.)
+
+7. Implement random_instance() for the main EJA class.
+
+8. Implement random_instance() for the subalgebra class.