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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 87a162c..fb89e5e 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,31 +1,12 @@
-1. Add CartesianProductEJA.
+1. Add references and start citing them.
 
-2. Add references and start citing them.
+2. Profile (and fix?) any remaining slow operations.
 
-3. Implement the octonion simple EJA.
+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. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
-
-5. Override random_instance(), one(), et cetera in DirectSumEJA.
-
-6. Switch to QQ in *all* algebras for _charpoly_coefficients().
-   This only works when we know that the basis can be rationalized...
-   which is the case at least for the concrete EJAs we provide,
-   but not in general.
-
-7. Pass already_echelonized (default: False) and echelon_basis
-   (default: None) into the subalgebra constructor. The value of
-   already_echelonized can be passed to V.span_of_basis() to save
-   some time, and usinf e.g. FreeModule_submodule_with_basis_field
-   we may somehow be able to pass the echelon basis straight in to
-   save time.
-
-   This may require supporting "basis" as a list of basis vectors
-   (as opposed to superalgebra elements) in the subalgebra constructor.
-
-8. Implement random_instance() for general algebras as random_eja().
-   Copy/paste the "general" construction into the other classes that
-   can use it. The general construction can be something like "call
-   random_instance() on something that inherits me and return the
-   result."
+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.