Timeline for Buchberger algorithm question
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2013 at 15:35 | vote | accept | Simpleperson | ||
| Jul 24, 2013 at 15:32 | answer | added | Vladimir Dotsenko | timeline score: 5 | |
| Jul 24, 2013 at 15:21 | comment | added | Vladimir Dotsenko | Oh I see. That was a very confusing way to formulate it. So you mean: "Is it enough to check that $S(g_i,g_j)$ has remainder 0 for some multivariate long division procedure?", right? | |
| Jul 24, 2013 at 3:43 | comment | added | Simpleperson | When I mean ordering, I don't mean the term order, but rather the order of the generators by which you execute the multivariate division algorithm. BTW, I've looked at Cox-Little-O'Shea and I think the answer is that one can use different orders (in the latter sense), but just want to confirm. | |
| Jul 24, 2013 at 2:30 | comment | added | Vladimir Dotsenko | Could you be a bit more clear? The property of being a Groebner basis depends on an ordering. So what is it that you are asking? Is it "Suppose that for each pair $(i,j)$ there is an order for which $S(g_i,g_j)$ has remainder 0. Is it true that for some order $G$ is a Groebner basis?" - or something else? | |
| Jul 24, 2013 at 2:01 | review | First posts | |||
| Jul 24, 2013 at 2:03 | |||||
| Jul 24, 2013 at 1:44 | history | asked | Simpleperson | CC BY-SA 3.0 |