Feature #39
Squarefree factorization
100%
Description
Implement squarefree factorization (most especially for polynomial rings).
This is just a parent task; it has many subtasks representing the various steps needed to reach the goal.
This mostly managed by John Abbott; some of the work is delegated to Alessio d'Ali`.
Subtasks
Related issues
History
#1 Updated by John Abbott over 10 years ago
- Status changed from New to Feedback
- Assignee set to John Abbott
The issue has been resolved by implementing Bernardin's algm (which seems to work quite well in practice).
The code has been ported into CoCoALib (with doc & tests, of course).
It seems to work fine in "normal" rings, but may not work some "unusual" rings (see #47 for more details).
Putting this issue into feedback: the code will be released publicly in a few days!
PS it looks as though I created far too many subtasks; initially it seemed that each subtask would require separate handling, but in the end just 2 impls did everything reasonably well.
#2 Updated by Anna Maria Bigatti over 10 years ago
- Target version set to CoCoALib-0.99532
#3 Updated by John Abbott about 10 years ago
- Status changed from Feedback to Closed