Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with root-systems
Search options not deleted
user 144655
2
votes
0
answers
68
views
Piecewise linear $\sigma_i$ - notation question
In cluster algebra framework, in order to get root clusters, a modified version of a simple reflection is used. Define $\sigma_i:\Phi_{\geq -1} \to \Phi_{\geq -1}$ by setting:
$ \sigma_i(\alpha) =
…
- 225
3
votes
2
answers
417
views
Reflection reverses a root string
I am trying to understand the part of the proof In Fulton's and Harris's Represantation Theory book where he shows that the length of the root string is at most 4:
Theorem If $\alpha,\beta$ are roots …
- 225