Timeline for Build a topological polytope with a specified CW-structure
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2014 at 0:02 | history | edited | Hugh Thomas | CC BY-SA 3.0 |
point out that my former answer is totally wrong
|
| Aug 20, 2014 at 18:39 | comment | added | Hugh Thomas | I am confused about what is happening. Please "unaccept" this answer (for now). If I can figure out what is going on I will add something. | |
| Aug 20, 2014 at 15:22 | comment | added | Prasit | When we construct the trees associated to a tubing of a graph, where do the levelings of the tree come from? In particular, why do we get complete levelings when we begin with a complete graph, a "youngest leveling" when we have a cyclic graph, and no leveling when we have a path graph. | |
| Aug 20, 2014 at 13:12 | comment | added | Hugh Thomas | Pages 9-11 of Forcey and Springfield explain how the map from the graph associahedron of the complete graph to the graph associahedron of the path graph is equivalent to forgetting the levels of a tree. I'll try to provide some more details of how the cyclohedron fits in. | |
| Aug 20, 2014 at 1:06 | comment | added | Prasit | "In order to interpret these as trees remembering the bottom vertex, you should do the usual thing to turn parenthesizations into trees, and then let the "bottom" vertex be the one including the number 1." Can you please elaborate? I am not quite sure how to do this part. | |
| Aug 19, 2014 at 17:40 | vote | accept | Prasit | ||
| Aug 20, 2014 at 20:08 | |||||
| Aug 19, 2014 at 17:34 | vote | accept | Prasit | ||
| Aug 19, 2014 at 17:40 | |||||
| Aug 19, 2014 at 16:03 | history | answered | Hugh Thomas | CC BY-SA 3.0 |