Activity
From 27 Apr 2023 to 26 May 2023
25 May 2023
-
14:30 CoCoALib Design #1744: Implement GBMill (aka Groebner Framework)
- Currently in CoCoA all GB-related computations are done in this way:
# prepare an ideal/ideal-like submodule in a s... -
- John Abbott wrote:
> A possible advantage of using "funny" indet names is that it is then clear that the value does ... -
- John Abbott wrote:
> A possible advantage of using "funny" indet names is that it is then clear that the value does ... -
- As a guideline: in CoCoA-4 there was the Groebner Framework:...
23 May 2023
-
19:09 CoCoALib Design #1744: Implement GBMill (aka Groebner Framework)
- A possible advantage of using "funny" indet names is that it is then clear that the value does not belong to the orig...
-
- The computation of a GBasis is the core computation of many others (colon, saturation, homogenization, ...).
Such GB... -
- I think we can leaving printing in a list as it is (for the time being).
Tagged values are (often) ones which we pri... -
- added test in exbugs.cocoa5
-
- John Abbott wrote:
> There was a bug in @sppoly.cpkg5@ where the asterisk was printed directly rather than to the ou... -
22 May 2023
-
- There was a bug in @sppoly.cpkg5@ where the asterisk was printed directly rather than to the output stream @D@.
Now ... -
- Printing of Hilbert series is "strange":...
19 May 2023
-
- Should we advance this issue to "feedback"?
-
- I would also like to be able to perform a GB computation in chunks determined by a time-out. It may suffice to have ...
-
- There should probably be a "graded" mode, and then the possibility to know whether the partial/truncated basis is com...
-
- Investigate and design about converting current "Buchberger"'s code into a GBMill, i.e. a class containing partial co...
-
- Truncated GBases can be quite useful.
Find a way to implement them without duplicating to much code.
Ideally we sho...
18 May 2023
-
- When asking for MinGens with homogeneous input, we do not need to compute the whole GBasis, not even to make pairs wh...
-
- New smallest example: I doubt I can beat this ;-)...
16 May 2023
-
- I have just checked out Anna's update, and confirm that the first example in comment 8 is now fast. Thanks to Anna.
-
- My suggestion above is not quite right.
The poly which I am saturating with respect to must be reduced modulo @I@.
...
15 May 2023
-
- I must do a check-out, or Anna must do a check-in? The example from comment 8 is still slow on my computer
-
- Let @P@ be a poly ring with indets @x[1]..x[n]@ and @y[1]..y[m]@.
Suppose the gens of ideal @I@ involve only @x@ ind...
12 May 2023
-
- smaller...
-
- See function...
-
- John Abbott wrote:
> Anna, could you please describe more explicitly what you are proposing?
> I am not sure I unde... -
- Thinking all this again, I noticed that we are now using the map just to detect if the symbol found is in the symbols...
-
- I checked my personal code.
My guess at the old history is that I made a @map<symbol, long>@ (long instead of RingEl...
11 May 2023
-
- I have my own prototype...
-
- John Abbott wrote:
> I think it might be helpful to put 1 or 2 spaces at the start of each line printed as "verbose"...
10 May 2023
-
- Anna pointed out verbally that my idea in comment 5 (above) cannot easily be made to work, because the "depth counter...
-
- We could just change the second example so that it uses all the indets in the chosen ring; then I'd get an error (sin...
-
- The example I tried is correct (as reported on the manual page).
I copied the second example *without noticing* that...
08 May 2023
-
- The manual for *@HilbertFn@* seems to need improvement.
_e.g._ @HilbertFn@ appears to work for modules too.
The e... -
- The manual now says *@(Poly or Quotient)Ring@*.
Is this sufficient/correct? From looking at the impl in @hp.cpkg5@...
06 May 2023
-
- I wonder if it could be made to work by assuming that all indets with weight 0 actually have epsilon (an infinitesima...
05 May 2023
-
- This example was generated by simplifying the original big example found by L.Robbiano
-
- In this example MinGens gives a result which is not minimal.
Can the algorithm MinGens work if the input is homogene... -
- the function IsHomog for ideals might take a long time computing a GBasis, but if
the check @IsHomog(gens(I))@ gives... -
- Sounds interesting: this is surely handy for "human handling".
Maybe the homogenizing ring could be created the firs...
03 May 2023
-
- In CoCoA a poly ring has default term-order @degrevlex@ which we regard as 1-graded.
My suggestion means that by def... -
- If the user creates a graded polynomial ring, maybe CoCoA could actually create 2 polynomial rings:
* the one reques...
29 Apr 2023
-
- (1) With a ZZ^1-grading I think it is enough to compute a "wdeg-rev" ReducedGBasis then "saturate" each element indep...
28 Apr 2023
-
- I had to look in to *@TmpGoperations.C@* to find out about how CoCoALib implements ideal homogenization (and saturati...
-
- How stable/clean is the code in *@TmpGOperations@*?
It forms a fairly central part of CoCoALib (and thus of CoCoA-5)...
Also available in: Atom