Timeline for Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2012 at 16:17 | comment | added | Samuel Reid | This answer turned out to be very helpful for my research on packing problems (treat the barycenter of a polyhedra as a vertex of a simplicial complex and you get a packing). Thank you! | |
| Mar 22, 2012 at 16:21 | history | edited | David E Speyer | CC BY-SA 3.0 |
added 437 characters in body
|
| Mar 22, 2012 at 16:13 | history | edited | David E Speyer | CC BY-SA 3.0 |
added 801 characters in body
|
| Mar 22, 2012 at 11:37 | comment | added | Raghav Kulkarni | This answer is helpful. The counter-examples you point to are interesting. And you are right that the question does not end here as for the small application of this that I have in mind the upper bound that you propose (if true) would work as good. So I would be interested in proving/disproving the $e^{O(\log v \cdot \log f)}$ bound. | |
| Mar 22, 2012 at 11:20 | vote | accept | Raghav Kulkarni | ||
| Mar 21, 2012 at 18:05 | history | edited | David E Speyer | CC BY-SA 3.0 |
added 671 characters in body
|
| Mar 21, 2012 at 18:00 | history | answered | David E Speyer | CC BY-SA 3.0 |