Timeline for Mean number of $n$-simplices per $(n-2)$-simplex in a triangulated $n$-manifold
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2022 at 17:00 | history | edited | Glorfindel | CC BY-SA 4.0 |
broken link fixed, cf. https://meta.mathoverflow.net/q/5301/70594
|
| Jul 29, 2012 at 4:05 | comment | added | Tom Goodwillie | If you use ordered triangulations, then yes there is a standard way, based on a standard way of triangulating the product of two simplices whose vertex sets are ordered. (Think of a simplex as the nerve of an ordered set so that a product of simplices appears as the nerve of the product of these ordered sets, a poset.) And it seems to me that it ought to lead to nice formulas for the $f$-vector of the product. | |
| Jul 28, 2012 at 22:13 | comment | added | Aaron Trout | @Tom Goodwillie: Is there a standard way to triangulate $M\times N$ given triangulations of $M$ and $N$? If so, is it easy to find the resulting $f$-vector in terms of the $f$-vectors for $N$ and $M$? If this is a well known procedure, my apologies for my ignorance! | |
| Jul 28, 2012 at 18:03 | comment | added | Tom Goodwillie | How far can you get by considering products of lower-dimensional manifolds? | |
| Jul 28, 2012 at 14:25 | history | edited | Aaron Trout | CC BY-SA 3.0 |
edited body
|
| Jul 28, 2012 at 13:54 | history | asked | Aaron Trout | CC BY-SA 3.0 |