Timeline for Number of simplicial polytopes with a given f-vector
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 25, 2011 at 15:49 | comment | added | Camilo Sarmiento | I just realized this bijection is actually older. For 3-dimensional convex polytopes it's Steinitz theorem (thanks again to Joseph for the reference). | |
| Jul 25, 2011 at 15:43 | vote | accept | Camilo Sarmiento | ||
| Jul 25, 2011 at 14:44 | comment | added | Camilo Sarmiento | I was also thinking this should bring no simplification at all, since it would be difficult to impose the (global) condition that the simplicial complex be a polytope while trying to enumerate. However, last week I heard that there are some ways to enumerate planar maps by considering a bijection to an appropriately defined set of trees, which should be easier to enumerate. See math.u-psud.fr/~jflegall/Goteborg3.pdf and books.google.de/… . | |
| Jul 23, 2011 at 0:57 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Jul 22, 2011 at 16:41 | comment | added | André Henriques | "...the condition that the simplicial complex be a convex polytope may simplify the situation a bit": unlikely. | |
| Jul 22, 2011 at 16:15 | history | edited | Camilo Sarmiento | CC BY-SA 3.0 |
added 308 characters in body
|
| Jul 22, 2011 at 15:53 | history | asked | Camilo Sarmiento | CC BY-SA 3.0 |