Timeline for Computing the connected component without primary decomposition
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2010 at 22:24 | comment | added | Jim Humphreys | It would be helpful to mention why you want to do this concrete search, as David also indicates in his answer. Computation with defining polynomials of a linear algebraic group is fairly uncommon. | |
| Nov 2, 2010 at 19:38 | answer | added | David E Speyer | timeline score: 2 | |
| Nov 2, 2010 at 15:30 | history | edited | yell | CC BY-SA 2.5 |
added 159 characters in body; deleted 1 characters in body; edited body; added 17 characters in body
|
| Nov 2, 2010 at 15:29 | comment | added | David E Speyer | It will already be radical. In characteristic zero, all group schemes are reduced. | |
| Nov 2, 2010 at 15:28 | comment | added | Mariano Suárez-Álvarez | How is $G$ given? | |
| Nov 2, 2010 at 15:28 | history | edited | Sándor Kovács |
edited tags
|
|
| Nov 2, 2010 at 15:25 | history | asked | yell | CC BY-SA 2.5 |