Timeline for Finding relations between invariant polynomials
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 27, 2019 at 18:32 | answer | added | AUNebulosa | timeline score: 0 | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Sep 3, 2015 at 9:04 | answer | added | user78294 | timeline score: 3 | |
| Dec 6, 2013 at 0:32 | comment | added | ThisNameForSale | If you have a sequence $S$ of polynomials, the Magma command $RelationIdeal(S)$ should give the answer w/o precising any invariant theory. Whether or not it will work in finite time and memory is a different question. | |
| Dec 6, 2013 at 0:28 | comment | added | Lev Borisov | It should be possible, but I am not handy with the computers. Many algebraic geometers also use Macaulay (rather Macaulay 2). It should be a simple code: you are mapping one polynomial ring into another and are looking for generators of the kernel ideal. Given the number of variables, I am not sure if the calculation is going to finish in reasonable amount of time, but it is worth a shot. | |
| Dec 5, 2013 at 15:19 | history | asked | mathdonk | CC BY-SA 3.0 |