Activity
From 07 Oct 2013 to 05 Nov 2013
30 Oct 2013
- 21:43 0.25 hour (Feature #342 (Closed): Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP)))
- JAA's opinion
- 18:50 0.50 hour (Feature #342 (Closed): Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP)))
- proposal for PushBack and consequences
- 10:52 0.25 hour (Bug #355 (Closed): Colon of zero ideal fails (zero-divisors))
- 10:05 2.00 hours (Bug #355 (Closed): Colon of zero ideal fails (zero-divisors))
- debugging, fixed, tested
29 Oct 2013
- 15:35 0.50 hour (Feature #150 (In Progress): RingOf rather than owner? (and than AmbientRing, ...))
- Possible disadvantage
- 14:48 0.25 hour (Feature #356 (Closed): IsZeroDivisor)
- checked, seems fine --> closed
- 14:30 0.25 hour (Feature #390 (Closed): Store unique copy of QQ[t_1..t_n] (RingQQt) in GlobalManager)
- checked, seems fine --> closed
- 14:25 0.25 hour (Bug #178 (Closed): IsHomog: should it throw an error when there is no grading?)
- checked, seems fine --> closed
- 13:45 0.25 hour (Feature #215 (Closed): Janet Bases: check and include code in CoCoALib (first prototype))
- general task done
- 13:39 0.25 hour (Bug #349 (Closed): IdealOfPoints: gens are actually a GBasis)
- checked, seems fine --> closed
- 13:33 0.25 hour (Bug #335 (Closed): Equality of (sub)modules)
- checked, seems fine --> closed
24 Oct 2013
- 14:56 0.25 hour (Design #411 (Closed): design of factorization template class)
- comment on design
23 Oct 2013
- 20:50 0.25 hour (Feature #39 (Closed): Squarefree factorization)
- Largely complete
- 20:46 0.25 hour (Feature #42 (Closed): Squarefree factorization - generic case)
- Apparently already done
- 20:41 0.25 hour (Feature #40 (Closed): Squarefree factorization - Alessio d'Ali`)
- Code has now been ported into CoCoALib
- 20:37 2.80 hours (Feature #41 (Closed): Squarefree factorization - overhead)
- It's largely over now
- 20:34 0.25 hour (Feature #43 (Closed): Squarefree factorization - for polynomials)
- Already achieved
- 20:31 0.10 hour (Feature #44 (Closed): Squarefree factorization - univariate polynomials)
- Already achieved
- 20:26 0.25 hour (Feature #45 (Closed): Squarefree factorization - univariate polynomials, char 0)
- Already achieved
- 20:23 0.25 hour (Feature #46 (Closed): Squarefree factorization - univariate polynomials, char p > 0)
- Already achieved
- 20:10 0.25 hour (Feature #48 (Closed): Squarefree factorization - multivariate polynomials, char 0)
- Already achieved
- 20:06 0.25 hour (Feature #49 (Closed): Squarefree factorization - multivariate polynomials, char p > 0)
- Already achieved
- 15:52 0.50 hour (Feature #409 (New): Minimal syzygies (optimized implementation))
- changed name from IsSpecial to IsInputPoly
- 15:32 3.00 hours (Feature #47 (Closed): Squarefree factorization - multivariate polynomials)
- Essentially complete
- 14:42 0.25 hour (Design #411 (Closed): design of factorization template class)
- Consequence
- 14:28 1.00 hour (Design #411 (Closed): design of factorization template class)
- Pros and cons
- 12:42 2.00 hours (Support #391 (Closed): Check consistency of template class factorization)
- Apparently already done
20 Oct 2013
- 14:49 0.50 hour (Feature #47 (Closed): Squarefree factorization - multivariate polynomials)
- Translating D'Ali's impl
18 Oct 2013
- 20:38 0.50 hour (Feature #407 (Closed): RingElem ctor from mpz_t (from Bruns))
- Annoying problem
- 16:37 0.50 hour (Feature #407 (Closed): RingElem ctor from mpz_t (from Bruns))
- Assignment from mpz_t?
14 Oct 2013
- 12:05 0.50 hour (Feature #407 (Closed): RingElem ctor from mpz_t (from Bruns))
- Pros and cons
10 Oct 2013
- 12:42 0.50 hour (Design #404 (Closed): deg(F,X) instead of MaxExponent(F,X) ?)
- Fn is called exponent for PPs
09 Oct 2013
- 18:09 0.25 hour (Feature #91 (Closed): Return type & name for "indets" of a PP)
- Name suggestions
Also available in: Atom