Timeline for Is there an algorithm to decide if an ideal contains monomials?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2013 at 13:18 | history | edited | Allen Knutson | CC BY-SA 3.0 |
added 139 characters in body; added 9 characters in body
|
| Apr 6, 2013 at 8:45 | comment | added | Allen Knutson | I find it hard to imagine why one would help you much for the next, but I dunno. The theorem I had there was pretty specialized to the context we needed it for. Anyway you can see for yourself. | |
| Apr 6, 2013 at 8:34 | comment | added | Thomas Kahle | I've always wondered if there is a faster way to get the $n$ ideals $I:x_i$ than computing $n$ elimination orders from scratch. There should be some Gröbner walk type technique that lets one modify the elimination order GB for one variable to get to the next. Is that what your reference is about? | |
| Apr 6, 2013 at 8:26 | history | edited | Allen Knutson | CC BY-SA 3.0 |
added 864 characters in body
|
| Apr 5, 2013 at 15:24 | vote | accept | Thomas Kahle | ||
| Apr 5, 2013 at 15:12 | history | answered | Allen Knutson | CC BY-SA 3.0 |