Timeline for Which linear combinations of simple roots are roots
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11 at 18:23 | comment | added | Ben McKay | In my LaTeX package lie-hasse you can see pictures of the positive roots, similar to those in Andrei Smolensky's answer (where you see all of the roots) in a Hasse diagram indicating how to travel from root to root by adding or subtracting simple roots. You could at least use this to see if you are getting the right numbers for your $n_{\alpha}$. ctan.org/pkg/lie-hasse?lang=en | |
| Dec 11 at 17:32 | comment | added | Andrei Smolensky | @BenMcKay Should be this one, if I recall what it was correctly: doi.org/10.1142/S0218196798000053 | |
| Dec 11 at 15:00 | comment | added | Ben McKay | @AndreiSmolensky: that link seems to be broken. | |
| Oct 15 at 9:41 | answer | added | Antoine de Saint Germain | timeline score: 0 | |
| Jul 9, 2023 at 17:08 | comment | added | Torsten Schoeneberg | Related: mathoverflow.net/q/13074/27465 | |
| Jun 18, 2014 at 12:10 | vote | accept | Xin Nie | ||
| Jun 18, 2014 at 12:10 | vote | accept | Xin Nie | ||
| Jun 18, 2014 at 12:10 | |||||
| Jun 18, 2014 at 10:51 | vote | accept | Xin Nie | ||
| Jun 18, 2014 at 12:10 | |||||
| Jun 17, 2014 at 19:07 | comment | added | Andrei Smolensky | Or, if you don't like tables, you can memorize (or print out) the weight diagrams of adjoint representations, where roots correspond to chains of edges starting from some zero weight node. For example, you can find the pictures and descriptions here: citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.5052 | |
| Jun 17, 2014 at 13:41 | answer | added | Allen Knutson | timeline score: 9 | |
| Jun 17, 2014 at 13:24 | answer | added | Alex | timeline score: 2 | |
| Jun 17, 2014 at 7:52 | comment | added | Sasha | Using the action of the Weyl group you can move your $\lambda$ into the dominant chamber. And in the dominant chamber there are at most two roots --- the dominant long root and the dominant short root which can be easily written down. Another "algorithm" (which is much faster) is to look at tables of roots, say in Bourbaki. | |
| Jun 17, 2014 at 6:44 | history | edited | Xin Nie | CC BY-SA 3.0 |
added 106 characters in body
|
| Jun 17, 2014 at 6:38 | history | asked | Xin Nie | CC BY-SA 3.0 |