Feature #937
LinDepMill: Mill for linear dependencies
Description
Currently in MinPoly.C there is a class IncrLinDep.
It is small and neat: I think this is the perfect paradigm for a "mill".
We feed it a vector: either we get a linear dependency or it is added to the "mill".
I think this is the core of many 0-dimensional operations: surely we can easily make an FGLM-ShapeLemma implementation extending the code of MinPolyQuotDef.
Should we promote it to a public class?
Related issues
History
#1
Updated by Anna Maria Bigatti 2 months ago
Updated by - Status changed from New to In Progress
- Assignee set to Anna Maria Bigatti
I have implemented the (hidden but present) function ShapeLemma which returns the whole lex-GB when the MinPoly has max degree (len(QB)). Essentially free after finding the MinPoly.
I think it deserves a more general interface: return MinPoly + GB if deg is max, otherwise only the MinPoly.
Maybe it deserves a dedicated redmine issue as well ;-)
#2
Updated by Anna Maria Bigatti 2 months ago
LinDepMill could also be used by MakeTermOrdMat.
#3
Updated by Anna Maria Bigatti 2 months ago
- Related to Slug #1070: Slug: MakeTermOrd (rk calls in RemoveRedundantRows) added
#4
Updated by Anna Maria Bigatti about 1 month ago
- Status changed from In Progress to Closed
- Target version changed from CoCoALib-1.0 to CoCoALib-0.99850
- % Done changed from 10 to 100
Many years have passed. This class has been thoroughly used/tested.
It is used in the functions ShapeLemma and FGLM (they need some final polishing for public usage).
Just one comment: the original name IncrLinDep has been modified into LinDepMill.
In the MinPoly code the object is called ILD with is quite puzzling, not knowing its origin.
Closing this issue.