Project

General

Profile

Feature #4

Squarefree GCD-free basis

Added by John Abbott over 12 years ago. Updated about 4 years ago.

Status:
Rejected
Priority:
Normal
Assignee:
John Abbott
Category:
New Function
Target version:
CoCoALib-0.99700
Start date:
19 Oct 2011
Due date:
% Done:

100%

Estimated time:
0.88 h
Spent time:
0.85 h

Description

From a non-empty collection of polynomials compute a square-free gcd-free basis.

Related issues

Related to CoCoALib - Feature #259: Squarefree(?) GCD-free basisClosed2012-10-09

History

#1 Updated by John Abbott over 10 years ago

Something to do over the Xmas holidays?
I thought I'd already implemented this but cannot find it anywhere (unless I gave it a strange name).

#2 Updated by Anna Maria Bigatti over 9 years ago

  • Target version set to CoCoALib-1.0

#3 Updated by John Abbott almost 6 years ago

  • Category set to New Function
  • Status changed from New to In Progress
  • Assignee set to John Abbott
  • % Done changed from 0 to 20

Is this not subsumed by issue #259?

The only remaining question is the "squarefree" part. We could just make the inputs squarefree and then call the general function; this won't be "optimal" in all cases, but perhaps should not be too bad...

#4 Updated by John Abbott almost 6 years ago

  • Target version changed from CoCoALib-1.0 to CoCoALib-0.99600

#5 Updated by John Abbott over 5 years ago

  • Target version changed from CoCoALib-0.99600 to CoCoALib-0.99650 November 2019

#6 Updated by John Abbott about 5 years ago

The "squarefree" version should only be for polynomials because it is too costly (in general) to tell if an integer is squarefree.

#7 Updated by John Abbott about 5 years ago

  • Target version changed from CoCoALib-0.99650 November 2019 to CoCoALib-1.0

I'm postponing this issue because we already have "coprime factor basis", and it is not yet clear to me whether we need also a "squarefree coprime factor basis".

#8 Updated by John Abbott about 4 years ago

  • Status changed from In Progress to Rejected
  • Target version changed from CoCoALib-1.0 to CoCoALib-0.99700
  • % Done changed from 20 to 100
  • Estimated time set to 0.88 h

I am rejecting this issue.
The "squarefree" part is too risky/costly for large integer args.
It could be done for polynomials, but then it is probably better simply to call a squarefree factorizer (before or after).

Maybe a new issue can be made if we really need a sqfr coprime factor basis in the future.

Rejecting.

Also available in: Atom PDF