X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=a9158127e857ccea2b430dc60d91a0465b010480;hb=e6a97298e3bd565b460c024d6edf53421ef9f201;hp=38aa85bfe7a5c5ecc4b97c880c05533e42b5ad69;hpb=09298a6b80a44847f506961e0eeccb8cdf2ad9d3;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 38aa85b..a915812 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,7 +1,4 @@
-A. Add tests for orthogonality in the Peirce decomposition.
-
-B. Add support for a symmetric positive-definite bilinear form in
-   the JordanSpinEJA.
+0. Add tests for orthogonality in the Peirce decomposition.
 
 1. Add CartesianProductEJA.
 
@@ -16,7 +13,6 @@ B. Add support for a symmetric positive-definite bilinear form in
 
 6. Can we make the minimal and characteristic polynomial tests work
    for trivial algebras, too? Then we wouldn't need the "nontrivial"
-   argument to random_eja().
-
-7. Solve the charpoly system with A_of_x.solve_right(x_powers[r])
-   rather than dumbass Cramer's rule.
+   argument to random_eja(). This would also allow us to potentially
+   pass a "size" of zero to the other constructors in random_eja() --
+   a code path that is basically untested right now.