Improvement: how to sort QuotientBasis?
QuotientBasis returns a list of power-products ordered by increasing lex (independently of the ordering in the ring).
This is slightly confusing for a human user.
sorted(QB) may tak considerably longer (100x) than computing the QB itself.
Can we make a sorted version without too much overhead? and/or make a new function
SortedQuotientBasis(I) faster than
#2 Updated by John Abbott about 1 year ago
- Status changed from New to In Progress
- % Done changed from 0 to 10
- One possibility is to have 2 fns
- another possibility is to have an optional 2nd arg
A first impl of the "sorted" version should simply call the unsorted version, and then sort the result. It might be slow, but will surely be correct.
A probably better way to implement the "sorted" version is to replace all calls to "concat" by calls to
merge (after checking that the args to
merge are correctly ordered themselves). I've no idea how much faster that might be than simply sorting the result of the original impl. The main problem seems to be that there would be considerable duplication of code :-(
#4 Updated by John Abbott 7 months ago
- Status changed from In Progress to Feedback
- Assignee set to John Abbott
- % Done changed from 10 to 90
- Estimated time set to 0.77 h
I have just moved the impl from
CoCoALibSupplement.C (what was it doing there?!?) to
There is already CoCoA-5 doc.
I have written 1 line of doc for CoCoA-5 ; strangely this is in
ideal.txt even though the source code is in
Should there be an example (or test) separate from that for