CoCoA » CoCoALib

03 Oct 2023

19:14 Slug #1757: gcd(f,f) is slow

I have just tried computing @RootBound(f)@. It is taking ages :-( [about 360s]
No doubt the problem is that it tak... John Abbott

18:54 Slug #1756: deg(f) is slow if f is long

What do we want to do if the OrdMat has a first row being all the same but not equal to 1?
The grading is StdDeg com... John Abbott

18:38 Slug #1756 (In Progress): deg(f) is slow if f is long

I think I have mostly solved this issue now. Anna had already added a *@IsStdGraded@* function in 2013. I have modi... John Abbott

17:10 Bug #1758: Graeffe "sign bug"

A reasonable solution could be to define @GraeffeN(f,n)@ to be the same as @resultant(f(y), y-x^n)@.
This would then... John Abbott

17:05 Feature #1763: implement ideal(R) for zero ideal, with no generators?

In comment 1 I used *@EmptyList@*; in comment 2 I used *@NoGens@*
I think I dislike @EmptyList@ because it is rather... John Abbott

14:36 Support #1761 (In Progress): MakeTermOrdMat: improve error mesg

Now the behaviour is as follows:... John Abbott

07 Sep 2023

11:44 Feature #1763: implement ideal(R) for zero ideal, with no generators?

Here is another idea. We could create a constant empty vector of @RingElem@, and use that.... John Abbott

11:37 Feature #1763: implement ideal(R) for zero ideal, with no generators?

Mmm, don't remember... I'm still on holiday (sort of).
We can do *@ideal(zero(P))@* and *@ideal(P,EmptyList)@*.
May... John Abbott

08:31 Feature #1763 (Rejected): implement ideal(R) for zero ideal, with no generators?

I'm fairly sure we used to have the constructor @ideal(R)@ for an ideal with no generators, but I cannot find any tra... Anna Maria Bigatti