COPYING,LICENSE: add (AGPL-3.0+)

[sage.d.git] / mjo / eja / TODO

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 5307527b5285eb821f75b8e9dfa58b2d512c10a9..b0d5378fab6ed7c7c981aaf0fd9a044ca18a1b07 100644 (file)
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -2,10 +2,19 @@
 
 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)
+4. Add dimension bounds on any tests over AA that compute element
+   subalgebras.
 
-   in eja_element.py returns False.
+5. The rational_algebra() stuff doesn't really belong in classes that
+   don't derive from RationalBasisEJA or its as-yet-nonexistent
+   element class.
+
+6. Add special det/trace method overrides for the algebras where we
+   know them? The only reason this might be tricky is because the
+   obvious solution is to subclass EJAElement, but then we might
+   collide with e.g. the Cartesian product element subclass.