Project

General

Profile

Activity

From 25 Aug 2019 to 23 Sep 2019

23 Sep 2019

13:00 Feature #1209: New function: HasPositiveGrading
Do you simply mean a @GradingDim@ function which can be applied to a @PPMonoid@ or a @SparsePolyRing@? John Abbott
12:54 Slug #1170: SmoothFactor: slow when a factor is found
An idea (in C++) is to have a sort of @SmoothFactor@ iterator which can be told to continue from where it has reached... John Abbott
12:41 Slug #1238: ReadExpr is too slow on long lists of monomial with many indets: ---> use RingElems instead
I have run the profiler.
A lot of time is spent in *@AreDistinct(vector<symbol>)@*; presumably the call is around @r...
John Abbott
12:20 Slug #1238: ReadExpr is too slow on long lists of monomial with many indets: ---> use RingElems instead
Here is another case where it is surprisingly slow:... John Abbott
12:16 Slug #1238: ReadExpr is too slow on long lists of monomial with many indets: ---> use RingElems instead
2019-09-23 This is still very slow. Here is a specific test case:... John Abbott
11:49 Bug #1211: HilbertSeries should check grading
JAA confirms that this bug still exists in the current build (2019-09-23).
John Abbott

13 Sep 2019

11:30 Support #1263: Tidy CoCoALib test directory
I added a new "exbug" to one of the @test-bugN.C@ files, and noticed that it was quite a nuisance having to add all t... John Abbott

11 Sep 2019

13:51 Bug #905: txt2tags: double quotes wrong in LaTeX
This is still a problem. It would be nice to fix it before a deadline on 29th Sept!
I am also not convinced by th...
John Abbott
11:29 Bug #1310 (Feedback): RealRoots: gives odd number of roots for deg 6 irred poly
I have found a bug, and fixed it! It produces reasonable answers on the two tests mentioned above:... John Abbott
10:30 Bug #1310: RealRoots: gives odd number of roots for deg 6 irred poly
I now have a simpler failing example:... John Abbott

10 Sep 2019

17:32 Bug #1310 (In Progress): RealRoots: gives odd number of roots for deg 6 irred poly
There appear to be two real roots: approx -4.00095 and 1.05
@RootBound(f)@ gives about 2.95; *this is wrong!*
John Abbott
13:53 Bug #1310 (Closed): RealRoots: gives odd number of roots for deg 6 irred poly
The following looks to be wrong:... John Abbott
12:26 Design #1309: SmoothFactor: allow limit = 1?
I have just changed the code to allow limit=1. All tests and examples pass (which suggests that the tests were not v... John Abbott
11:58 Design #1309: SmoothFactor: allow limit = 1?
There are two separate impls for @SmoothFactor@ (one for @MachineInt@ and one for @BigInt@). One allowed the limit 1... John Abbott
11:41 Design #1309 (In Progress): SmoothFactor: allow limit = 1?
The original reason for imposing the limit was to help users detect "obviously silly" function calls. Now I think th... John Abbott
11:36 Design #1309 (Closed): SmoothFactor: allow limit = 1?
The @SmoothFactor@ function tries to factorize integers by dividing by all primes up to a specified limit.
Current...
John Abbott

05 Sep 2019

16:29 Bug #1308: test-GFan1 fails
How much backward compatibility should be maintained? It might be too tricky; perhaps we should just require that us... John Abbott
16:27 Bug #1308 (Closed): test-GFan1 fails
I have moved to @gfanslib-0.6.2@ and now @test-GFan1@ produces the following error:... John Abbott

02 Sep 2019

16:47 Feature #1306: exgcd over integers (ZZ)
Name *@extgcd@*?
I prefer with the *'t'*
Anna Maria Bigatti
16:12 Feature #1306: exgcd over integers (ZZ)
The cofactors are defined only modulo the lattice of "syzygies" (kernel of the row matrix); the hope is that the vect... John Abbott
16:08 Feature #1306 (In Progress): exgcd over integers (ZZ)
Implement a general extended gcd over the integers.
The idea is that the cofactors should be reasonably small.
Pr...
John Abbott

29 Aug 2019

14:55 Feature #1227: exgcd; solve Bezout equation
An exgcd function would be very useful.
It is used in computing the Hermite normal form (#1304) and in computing Gr...
Florian Walsh
 

Also available in: Atom