Activity
From 22 Oct 2013 to 20 Nov 2013
20 Nov 2013
-
19:58 Feature #233: AsINT and AsRAT -- ConvertTo<BigInt> and ConvertTo<BigRat>
- An advantage of Anna's suggested names is that they are more compact than using the @ConvertTo@ template fn.
JAA s... -
19:51 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP))
- @PushFront@ and @PushBack@ for PPs have already been implemented (no idea when), but they were not documented. I hav...
30 Oct 2013
-
21:43 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP))
- I, too, favour proposal (1):
* it is far simpler to implement
* it is simple to understand the restriction
* it shoul... -
19:04 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP))
- Dear Anna,
I agree that (1) is the better choice. Given that PushBack copies the exponent vector, I think it is th... -
18:50 Feature #342 (In Progress): Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP))
- Winfried Bruns wrote:
> In my version of QQ[x] -> Z[x] I am using PushBack to build the target polynomial (also for ... -
13:32 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP))
- This is the first i am using redmine actively.
In my version of QQ[x] -> Z[x] I am using PushBack to build the tar... -
10:52 Bug #355 (Closed): Colon of zero ideal fails (zero-divisors)
-
10:05 Bug #355: Colon of zero ideal fails (zero-divisors)
- all fixed (it didn't like to have a 0 in the divisor's generators).
Meanwhile @IsZeroDivisor@ has been implemented a...
29 Oct 2013
-
15:35 Feature #150: RingOf rather than owner? (and than AmbientRing, ...)
- *POSSIBLE DISADVANTAGE* Using names such as @RingOf@, @PPMOf@ (rather than having a single name) could make template ...
-
14:48 Feature #356 (Closed): IsZeroDivisor
- ...
-
14:30 Feature #390 (Closed): Store unique copy of QQ[t_1..t_n] (RingQQt) in GlobalManager
-
14:25 Bug #178 (Closed): IsHomog: should it throw an error when there is no grading?
-
13:50 Feature #312: LongRange(a,b) returning vector of long a..b (included)
- John Abbott wrote:
> It might be worth moving the impl into its own *separate file*: this would remove the need to i... -
13:45 Feature #215 (Feedback): Janet Bases: check and include code in CoCoALib (first prototype)
- The general task is fully done.
Yet to do: add JB field in ideal in cocoalib, and consequent functions in cocoa-5 -
13:39 Bug #349 (Closed): IdealOfPoints: gens are actually a GBasis
-
13:33 Bug #335 (Closed): Equality of (sub)modules
-
13:28 Design #411 (Feedback): design of factorization template class
24 Oct 2013
-
14:56 Design #411: design of factorization template class
- > Currently JAA prefers method (A) because:
> # it's already impl'ed, so no extra work needed
> # it is easier to u...
23 Oct 2013
-
20:50 Feature #39 (Feedback): Squarefree factorization
- The issue has been resolved by implementing Bernardin's algm (which seems to work quite well in practice).
The code ... -
20:46 Feature #42 (Closed): Squarefree factorization - generic case
- Not sure how good an idea it is to have the generic fn.
Anyway there is already @SqfreeFactor_generic@.
Closing t... -
20:41 Feature #40 (Closed): Squarefree factorization - Alessio d'Ali`
- JAA has now ported d'Ali's code into CoCoALib (and added doc & tests).
Closing this issue.
-
20:37 Feature #41 (Closed): Squarefree factorization - overhead
- Task is essentially finished now that d'Ali's code has been ported.
Closing.
-
20:34 Feature #43 (Closed): Squarefree factorization - for polynomials
- This entire task subtree was effectively resolved by the porting of d'Ali's impl of Bernardin's algm (see #47).
Th... -
20:31 Feature #44 (Closed): Squarefree factorization - univariate polynomials
- The multivariate code (port of d'Ali's impl of Bernardin's algm) also handles the univariate case, and seems to be fa...
-
20:26 Feature #45 (Closed): Squarefree factorization - univariate polynomials, char 0
- This is effectively covered by the port of d'Ali's impl of Bernardin's (multivariate) algm. Efficiency of the multiv...
-
20:23 Feature #46 (Closed): Squarefree factorization - univariate polynomials, char p > 0
- This task is already handled by the port of d'Ali's impl of Bernardin's algm.
-
20:10 Feature #48 (Closed): Squarefree factorization - multivariate polynomials, char 0
- This case is effectively covered by the porting of d'Ali's code.
Might still need some tweaking to handle "strange... -
20:06 Feature #49 (Closed): Squarefree factorization - multivariate polynomials, char p > 0
- This case is already dealt with by the porting of d'Ali's code (see #47).
-
15:32 Feature #47: Squarefree factorization - multivariate polynomials
- Translation of d'Ali's impl is now complete.
Code has been checked in; incl doc and tests.
Some minor points remain ... -
14:42 Design #411 (In Progress): design of factorization template class
- Once this matter is resolved, we can change the file @TmpFactor@ into @factor@; strictly the @Tmp@ prefix should have...
-
14:28 Design #411: design of factorization template class
- This question arose because I have just implemented @SqfreeFactor@, and thought that it might be nice to guarantee th...
-
12:54 Design #411 (Closed): design of factorization template class
- Which is the better of the following two ways of implementing the factorization class?
(A) the current impl
* rec... -
12:42 Support #391 (In Progress): Check consistency of template class factorization
- I noticed yesterday that there is a fn @ourCheckConsistency@ for factorizations.
This probably does what is needed -...
Also available in: Atom