Activity
From 13 Nov 2011 to 12 Dec 2011
07 Dec 2011
- 10:13 Support #59 (New): List of all functions in CoCoALib
- It would be nice to be able to generate (automatically!) a list of all functions in CoCoALib and the file where they ...
06 Dec 2011
- 14:14 Feature #41: Squarefree factorization - overhead
- Weekly meeting with D'Ali`.
His impl of Bernardin's method is largely complete, and seems to work fine in tests.
... - 12:49 Feature #40: Squarefree factorization - Alessio d'Ali`
- D'Ali` has almost finished refinement and testing of his impl of Bernardin's algm.
He will check the details about th...
05 Dec 2011
- 18:27 Bug #36 (Closed): Saturation
- 17:42 Bug #36 (Resolved): Saturation
- 14:07 Bug #36: Saturation
- Use QQ[x,y];
I:=ideal (x);
J:=ideal(x,y);
Saturation(I,J);
30 Nov 2011
- 17:42 Feature #51 (Closed): polynomial coefficient extraction w.r.t. variable
- Given a multivariate polynomial and an indet X (or set of indets?)
Produce a list(?) of "coeffs" w.r.t. X; probably ... - 17:38 Feature #50 (Closed): Polynomial content
- New function(s) to compute content of a poly w.r.t. a given indet.
In which ring does the result lie?
* if poly i... - 17:34 Feature #49 (Closed): Squarefree factorization - multivariate polynomials, char p > 0
- Conceptually trickier than char=0 case because we must handle:
* inseparable polys whose derivative is 0 but which a... - 17:31 Feature #48 (Closed): Squarefree factorization - multivariate polynomials, char 0
- No obvious new conceptual problems. Efficiency may be an issue. Consider modular approach?
What happens if coeff... - 17:28 Feature #47 (Closed): Squarefree factorization - multivariate polynomials
- A bit tricker than univariate. Seems to need content-free factorization.
- 17:26 Feature #46 (Closed): Squarefree factorization - univariate polynomials, char p > 0
- We consider only the case of prime characteristic.
Needs more care than char=0 case because:
* p-th power of a po... - 17:22 Feature #45 (Closed): Squarefree factorization - univariate polynomials, char 0
- Conceptually the simplest case.
We might want to investigate a modular approach.
- 17:20 Feature #44 (Closed): Squarefree factorization - univariate polynomials
- For the case of sqfr factorization of univariate polynomials, it is easy to obtain the coarsest sqfr factorization.
- 17:18 Feature #43 (Closed): Squarefree factorization - for polynomials
- Sqfr factorization in a polynomial ring (with coeffs in a field) is the case we are most interested in.
- 17:16 Feature #42 (Closed): Squarefree factorization - generic case
- Squarefree factorization can be effected in any ring where (irreducible) factorization is possible.
The default be... - 16:56 Feature #40: Squarefree factorization - Alessio d'Ali`
- d'Ali` has completed a first impl of Bernardin's algorithm.
Ported to C5 by JAA. Tests taken from Bernardin's paper... - 16:17 Feature #40 (Closed): Squarefree factorization - Alessio d'Ali`
- Alessio d'Ali` is implementing some stages of the squarefree factorization task, under the supervision of John Abbott...
- 16:21 Feature #41: Squarefree factorization - overhead
- Managing redmine.
Meeting with d'Ali`; also emails etc.
Writing first draft of CoCoA report on squarefree factoriza... - 16:19 Feature #41 (Closed): Squarefree factorization - overhead
- Management and sundry other tasks related to the implementation of squarefree factorization
- 16:04 Feature #39 (Closed): Squarefree factorization
- Implement squarefree factorization (most especially for polynomial rings).
This is just a parent task; it has many... - 16:00 Feature #17: implement "binomial" (coefficient) for RingElem
- Please clarify what exactly you want the function to do, and what values it accepts as args. For instance is the fol...
- 08:31 Feature #37: matrix constructors
- JAA: C4 has a function for creating an identity matrix. It also has a means of creating a zero matrix (of specified ...
- 08:25 Feature #37 (Closed): matrix constructors
- Comments about matrix constructors: mainly "ring or not ring?"
*IdentityMat(QQ,2)*, *ZeroMat(QQ,2,4)*, *ConcatHor*...
29 Nov 2011
- 16:39 Bug #36 (Closed): Saturation
- Use QQ[x,y];
I:=Ideal(x,y-1);
J:=Ideal(x,y-2);
Saturation(I,J);
ideal(1)
La risposta giusta è Ideal(x,y-1) oss...
Also available in: Atom