Timeline for Elements of Coxeter group whose simple reflections pairwise commute
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 15, 2018 at 3:45 | vote | accept | GA316 | ||
| Mar 12, 2018 at 10:21 | comment | added | Christian Stump | @AHusain: edited that I meant "not much going on" from the viewpoint of Coxeter systems. | |
| Mar 12, 2018 at 10:20 | history | edited | Christian Stump | CC BY-SA 3.0 |
added sentence according to AHusain's comment
|
| Mar 12, 2018 at 10:13 | comment | added | Christian Stump | @YCor: edited for clarification. | |
| Mar 12, 2018 at 10:13 | history | edited | Christian Stump | CC BY-SA 3.0 |
Expanded according to YCor's suggestion
|
| Mar 12, 2018 at 9:33 | comment | added | AHusain | Maybe they want to actually count those independent subsets in G. Then there is "much going on" as the number of vertices grows. Like maximum independent set being NP-hard. | |
| Mar 12, 2018 at 9:03 | comment | added | YCor | Since it took me hard time to understand your sentence "is in bijection..." let me rephrase it: the map from the set of [finite] totally disconnected subsets of $G$ to $W$, mapping $\{u_1,\dots,u_n\}$ (all distinct) to $u_1\dots u_n$, is a bijection into $X(G)$. Note that for a finite graph $G$, this is finite regardless of whether $W$ is finite. | |
| Mar 12, 2018 at 8:35 | history | answered | Christian Stump | CC BY-SA 3.0 |