Project

General

Profile

Design #1798

Computing in sub polyring

Added by John Abbott about 1 month ago. Updated about 1 month ago.

Status:
New
Priority:
Normal
Assignee:
-
Category:
Improving
Target version:
CoCoALib-0.99880
Start date:
22 Mar 2024
Due date:
% Done:

0%

Estimated time:

Description

Investigate whether it is a good idea to adapt certain operations to compute in a sub polyring (without unnecessary indets)
Which functions would benefit?
How to specify the sub polyring and mapping back and forth.

Related issues

Related to CoCoALib - Bug #1641: gcd does not recognize univariate input Closed2021-12-20

Related to CoCoALib - Slug #1057: Slug: Polynomial ring contructor slow with (big) matrix orderingIn Progress2017-05-04

History

#1 Updated by John Abbott about 1 month ago

  • Related to Bug #1641: gcd does not recognize univariate input added

#2 Updated by Anna Maria Bigatti about 1 month ago

  • Related to Slug #1057: Slug: Polynomial ring contructor slow with (big) matrix ordering added

#3 Updated by Anna Maria Bigatti about 1 month ago

From #1641-11
It seems it's the "high number of variables" problem, and syz itself is quite fast: this examples takes ~4s on my computer.
Try with verbosity (first check out by verbosity additions):

/**/ SetVerbosityLevel(130);
/**/ /**/ use ZZ/(19)[u[1..400],x,y[1..400]];
/**/ f1 := x^4 -x^2 +7*x -7;
/**/ f2 := x^4 +4*x^3 -6*x^2 -6*x +7;
/**/ g1 := subst(f1,x,u[1]-y[1]);
/**/ g2 := subst(f2,x,u[1]-y[1]);
/**/ t0 := CpuTime(); syz([g1,g1]); TimeFrom(t0);

#4 Updated by Anna Maria Bigatti about 1 month ago

The test in note-3 would be faster if called in the minimal sub-polyring.

Also available in: Atom PDF