Activity

From 07 Mar 2012 to 05 Apr 2012

14:27 Feature #127 (In Progress): Convert DUPFF code to C++: Convert the old factorizer C code "DUPFF" into C++. John Abbott
14:26 Feature #126 (New): New datastructures directory: Create a new datastructures directory to hold source code for impls of various datastructures (e.g. the various Distr... John Abbott
14:23 Feature #125 (In Progress): Matrix equation solving; linear system solving: Add code for solving linear systems. There are several subcases:
* generic case over a field
* full rank and not f... John Abbott
14:12 Feature #124: change long args in matrices into MachineInt (?): The args being considered are "indices"; we should be consistent regarding all sorts of index (well, at least non-neg... John Abbott

15:20 Feature #124 (Rejected): change long args in matrices into MachineInt (?): For "public" functions (not member functions) like... Anna Maria Bigatti
13:07 Feature #123 (New): IdealOfPoints with generic coeffs: Think about the implementation of IdealOfPoints in the case of generic coefficients (_e.g._ in *@QQ(a)@*)
Implement ... Anna Maria Bigatti
09:37 Feature #122 (Closed): Porting "LinKer": This issue is *closed*; it is a *DUPLICATE* of #206
Port cocoa-4 C code about LinKer to cocoalib.
Anna Maria Bigatti
09:22 Feature #121 (Closed): Porting "IdealOfPoints": Port in cocoalib the cocoa-4 C code about BuchbergerMoeller.
An important step in it is the lifting from Fp --> QQ... Anna Maria Bigatti

21:48 Slug #120: LT over QQ: surprisingly slow: My "noddy" program for computing GBases can do the whole computation in a few seconds...
John Abbott
21:08 Slug #120: LT over QQ: surprisingly slow: Here is another suspect starting ideal in @QQ[x,y,z],Lex@
@[x^4 +x*y^2*z +y^4, x^3*y +x^2*z^2 +z^2]@
John Abbott
20:40 Slug #120 (New): LT over QQ: surprisingly slow: The following should compute a LT ideal of a small ideal (using lex).
It takes longer than I would expect over QQ --... John Abbott
17:30 Bug #119 (Closed): CoCoA4io: The file @CoCoA4io@ should not be inside CoCoALib -- it belongs in CoCoAServer.
Move it... will lead to some consequ... John Abbott

15:22 Feature #116 (Closed): ordering matrices with rational coefficients: Anna Maria Bigatti

19:09 Feature #116 (Closed): ordering matrices with rational coefficients: it is useful to allow rational coefficients (why not?) and appropriate conversion into ZZ when necessary (optimized O... Anna Maria Bigatti
14:36 Bug #22: Rename PPMonoidEvZZ?: We have not yet decided about internal impl names.
JAA still likes his suggestion made two posts ago.
John Abbott
14:34 Bug #22: Rename PPMonoidEvZZ?: We don't have time to complete this change before 0.9950.
However we have decided that it is simplest for the user... John Abbott
12:55 Support #75: Documentation review by Caleo: Alessandra reports:
# the examples are mostly OK; she reported some minor problems which J+A attended to immediately... John Abbott

19:11 Bug #114 (In Progress): Ideals of polynomials: Currently operations special to ideals in polynomial rings are located in @SparsePolyRing.H@ -- this seems incorrect.... John Abbott

17:02 Feature #113 (In Progress): Introduce PartialHom: Currently CoCoALib does not distinguish between proper homs and partial homs.
Thus we can create a (partial) RingH... John Abbott
12:39 Support #75: Documentation review by Caleo: Alessandra reports:
* doc for almost all rings (except @ring@, @RingElem@) needs to be better organized
* reference... John Abbott
11:37 Support #112 (New): automatic creation of all function signatures: Is it possible to create a readable collection of all function signatures and (more difficult) to link to the correct... Anna Maria Bigatti

15:22 Bug #111: Mod fn for computing remainder: The use of @tdiv@ functions produces a (pleasing) sign symmetry:
# namely @A%B = - ((-A)%B) = - A%(-B) = (-A)%(-B)@
... John Abbott

16:03 Bug #111 (Closed): Mod fn for computing remainder: The doc says the result is least non-neg remainder...
BUT the code uses @mpz_tdiv@ which "truncates" towards zero, s... John Abbott
15:55 Feature #50: Polynomial content: Created two fns:
* *@content@* computes "content" of the coeffs, result is in CoeffRing
* *@ContentWRT@* computes "co... John Abbott
10:10 Feature #107: Recognizing finite fields: Other functions which finite fields should offer:
* @IsPthPower@
* @IsPthPower2@ says whether arg is a P^k-th power (... John Abbott

16:11 Feature #40: Squarefree factorization - Alessio d'Ali`: Alessio has not found any criterion for a good order in which to "eliminate" the indets.
He did suggest offering an ... John Abbott
11:56 Feature #107 (Closed): Recognizing finite fields: The case of polynomials over finite fields can often be handled specially. We must add functions to facilitate the d... John Abbott

15:19 Bug #22: Rename PPMonoidEvZZ?: Here is an alternative suggestion (affecting the names of all PPMonoids).
The underlying principle is that an obje... John Abbott

18:01 Feature #51: polynomial coefficient extraction w.r.t. variable: JAA has made a first impl.
Still unsure about the interface (_i.e._ the type of the result & also the type of the par... John Abbott
17:47 Bug #21 (Closed): Rename NumTheory and NumTheoryQQ: The simplest solution seemed to be to merge @NumTheoryQQ@ into @NumTheory@. This avoids a possibly confusing, seemin... John Abbott
12:02 Support #75: Documentation review by Caleo: Alessandra reports:
# documentation for @ring@ & @RingElem@ is mostly OK (but still not complete)
@ex-RingElem1@ ... John Abbott

13:01 Feature #40: Squarefree factorization - Alessio d'Ali`: Alessio and John have both implemented content free factorization.
The CoCoALib impl is slightly faster -- but we ran... John Abbott

Also available in: Atom

CoCoA » CoCoALib