Timeline for A technical question about root systems
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 25, 2015 at 7:04 | history | edited | user | CC BY-SA 3.0 |
deleted 1967 characters in body
|
| Nov 6, 2015 at 16:28 | vote | accept | user | ||
| Nov 2, 2015 at 16:36 | history | edited | user | CC BY-SA 3.0 |
briefly explain your changes (corrected spelling, fixed grammar, improved formatting)
|
| Nov 2, 2015 at 3:41 | history | edited | user | CC BY-SA 3.0 |
added 280 characters in body
|
| Nov 1, 2015 at 23:31 | comment | added | Jim Humphreys | @user: My proposed $E_7$ counterexample is not quite right, but if I have time I'll check further. Anyway, it's best to look at all possibilities first. Springer's tables are useful for most of the exceptional types. | |
| Nov 1, 2015 at 23:01 | comment | added | YCor | The original title wasn't great but "A technical question about..." is a quite poor choice of title too. | |
| Nov 1, 2015 at 18:47 | answer | added | Andrei Smolensky | timeline score: 4 | |
| S Nov 1, 2015 at 17:10 | history | suggested | LSpice | CC BY-SA 3.0 |
Smoothed language and notation
|
| Nov 1, 2015 at 16:53 | review | Suggested edits | |||
| S Nov 1, 2015 at 17:10 | |||||
| Nov 1, 2015 at 15:45 | history | edited | user | CC BY-SA 3.0 |
added 389 characters in body; edited title
|
| Nov 1, 2015 at 15:20 | comment | added | Jim Humphreys | Can you say anything at all about what motivates this rather technical formulation? Also, you seem to be tacitly assuming that $n \geq 3$. Since it's possible to get a rigorous answer just by checking the irreducible root systems case-by-case, maybe that's a better starting point than just taking a quick look. [By the way, the header is not informative. Maybe just try something like "A technical question about root systems"?] | |
| Nov 1, 2015 at 6:11 | history | asked | user | CC BY-SA 3.0 |