Timeline for How to find the generic initial ideal?
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Jan 13, 2015 at 7:43 | history | suggested | user 1 | CC BY-SA 3.0 |
format grammar
|
Jan 13, 2015 at 7:24 | review | Suggested edits | |||
S Jan 13, 2015 at 7:43 | |||||
Apr 27, 2012 at 12:01 | comment | added | Thomas Kahle | As I said, to find/prove the generic intitial ideal you have to do a generic coordinate transform and compute the initial ideal. Whether this can be carried out depends on the ideal that you are giving. If you want it for just one ideal, then you can choose a random coordinate transform and with probability one you are fine. If you want a class of examples, like "generated by two forms of degree $d,e$ then you need to do it in general. Note that the code that I gave is that 'more general'. It proves the statement in the book, it is not computing an example. | |
Apr 26, 2012 at 11:58 | vote | accept | Strongart | ||
Apr 19, 2012 at 11:47 | comment | added | Strongart | Maybe my question is not very exact,MY interesting is not at the computer algebra,I just want to know the method to find or prove the generic initial ideal.If my example is something complicated to work by hand,you can change other easy case.Miller's book use the comprehensive Grobner basis,does it important? | |
Apr 15, 2012 at 15:09 | history | edited | Thomas Kahle | CC BY-SA 3.0 |
expand on a computer proof
|
Apr 15, 2012 at 10:48 | comment | added | Strongart | I am just a beginner,does any example to show it? | |
Apr 12, 2012 at 9:08 | history | answered | Thomas Kahle | CC BY-SA 3.0 |