Activity
From 02 Sep 2019 to 01 Oct 2019
01 Oct 2019
-
15:42 Feature #1249 (Closed): principal ideal has a Gbasis
-
11:57 Feature #1249: principal ideal has a Gbasis
- Has this already been done?
I think what Anna showed me in Genova, indicated that it has been done. If so, we can c... -
- Added a test (to @test-bug1.C@).
Corrected name in doc in @doc/txt/NumTheory.txt@.
-
- 2019-10-01: I have just tried the example from comment 2, and now it takes about 5.9s on my computer.
-
- We should either close this issue (almost immediately), or postpone it (to 0.99700?).
-
- I have increased this to max priority because I believe it is trivial to achieve, and it would be nice to close the i...
-
- Can we use a bigger modulus now that we are effectively assuming 64-bit platform? (are we?)
-
- Here is a short file which checks the computation times of the examples given above:...
-
- I changed the names (not sure when).
A problem with the integer version is that the "squarefree" part is potential... -
- This has been in "feedback" for 7 months, so I'm closing.
30 Sep 2019
-
- *CAREFUL* with the suggestions below: it is likely the @RootBound@ is used internally when factorizing or computing s...
-
- It maybe possible to improve @RootBound@ (in some cases) by using @SqfreeFactor@.
Also the CoCoA-5 prototype @Good... -
- I have transferred test-bugN into test-bug1 for N=6,7,8,9. So far, so good.
-
- Sqfr decomp should always be reasonably quick; full factorization could be slow if the input is "nasty".
One could... -
- I have already begun writing a package called @RRList@.
I think this is related, esp. as regards combining the inter... -
- Consider changing @RealRoots@ so that it computes the sqfr decomp of the input poly, then works on the separate piece...
27 Sep 2019
-
-
- Works reasonably well for me. Closing.
25 Sep 2019
-
- Where should the documentation go?
-
-
- Anna says OK to my "hack".
Now I need to document and check everything in.
-
- The point is that @make veryclean@ also deletes (most of?) the files generated by configuration.
Something is evid... -
- The error mesgs appear when the makefile tries to rebuild the dependencies.
-
- I did something like the following, and ended with lots of error messages about @PREPROCESSOR_DEFNS.H@ not existing.
... -
- Anna approves of merging the exbugs into a single file, and to including @CoCoA/library.H@.
Do this (soon!)
-
- Fixed. CVSed.
-
- We decided (personal discussion) to implement it only for @ring@, because the real utility of this function is for co...
24 Sep 2019
-
-
- we need to play with the arguments in ...
-
- Anna thinks this may be easy to resolve.
-
- In the index/table-of-contents there is no enough space for section numbers greater than 99.
The section number ov... -
- Apparently we decided to remove the function I was going to use (@IsPosiveGrading@ with two args), but in the time be...
-
- Now I understand what I meant.
+ There is a function called @IsPositiveGrading@ taking a weight matrix for input. T...
23 Sep 2019
-
- Do you simply mean a @GradingDim@ function which can be applied to a @PPMonoid@ or a @SparsePolyRing@?
-
- An idea (in C++) is to have a sort of @SmoothFactor@ iterator which can be told to continue from where it has reached...
-
- I have run the profiler.
A lot of time is spent in *@AreDistinct(vector<symbol>)@*; presumably the call is around @r... -
- Here is another case where it is surprisingly slow:...
-
- 2019-09-23 This is still very slow. Here is a specific test case:...
-
- JAA confirms that this bug still exists in the current build (2019-09-23).
13 Sep 2019
-
- 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...
11 Sep 2019
-
- 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... -
- I have found a bug, and fixed it! It produces reasonable answers on the two tests mentioned above:...
-
- I now have a simpler failing example:...
10 Sep 2019
-
- There appear to be two real roots: approx -4.00095 and 1.05
@RootBound(f)@ gives about 2.95; *this is wrong!* -
- The following looks to be wrong:...
-
- I have just changed the code to allow limit=1. All tests and examples pass (which suggests that the tests were not v...
-
- There are two separate impls for @SmoothFactor@ (one for @MachineInt@ and one for @BigInt@). One allowed the limit 1...
-
- The original reason for imposing the limit was to help users detect "obviously silly" function calls. Now I think th...
-
- The @SmoothFactor@ function tries to factorize integers by dividing by all primes up to a specified limit.
Current...
05 Sep 2019
-
- How much backward compatibility should be maintained? It might be too tricky; perhaps we should just require that us...
-
- I have moved to @gfanslib-0.6.2@ and now @test-GFan1@ produces the following error:...
02 Sep 2019
-
- Name *@extgcd@*?
I prefer with the *'t'*
-
- The cofactors are defined only modulo the lattice of "syzygies" (kernel of the row matrix); the hope is that the vect...
-
- Implement a general extended gcd over the integers.
The idea is that the cofactors should be reasonably small.
Pr...
Also available in: Atom