Timeline for How to speed up the process for calculating the Groebner basis?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2022 at 6:14 | answer | added | user64494 | timeline score: 4 | |
| Oct 24, 2022 at 19:00 | comment | added | jjcale | It might be faster to calculate Gröbner basis modulo primes and then go back to rational numbers . Try github.com/broune/mathicgb . | |
| Oct 24, 2022 at 12:11 | history | became hot network question | |||
| Oct 24, 2022 at 10:27 | comment | added | Vladimir Dotsenko | The ordering of variables $a1,a2,a3,b1,b2,b3,c1,c2,c3,d1,d2,d3$ seems to be good. At least in Magma a Gröbner basis is computed in fractions of a second, once that order is given. | |
| Oct 24, 2022 at 10:14 | answer | added | Robert Bryant | timeline score: 20 | |
| Oct 24, 2022 at 7:44 | comment | added | Gabriel | Thanks, I will take a look at the comments. | |
| Oct 24, 2022 at 6:37 | answer | added | user493469 | timeline score: 9 | |
| Oct 24, 2022 at 5:13 | comment | added | Jim Conant | Some relevant comments here: mathoverflow.net/questions/181350/… | |
| Oct 24, 2022 at 4:55 | review | Close votes | |||
| Oct 30, 2022 at 3:07 | |||||
| Oct 24, 2022 at 4:35 | comment | added | Ryan Budney | The Buchberger algorithm has a few parameters you can throw into it. Usually the monomial ordering is the main one. If Mathematica / Maple doesn't let you modify that, you can probably find some alternative libraries that do. That said, I'm guessing this isn't considered an appropriate question for the forum. | |
| Oct 24, 2022 at 4:20 | history | edited | Gabriel | CC BY-SA 4.0 |
edited body
|
| S Oct 24, 2022 at 4:10 | review | First questions | |||
| Oct 24, 2022 at 5:50 | |||||
| S Oct 24, 2022 at 4:10 | history | asked | Gabriel | CC BY-SA 4.0 |