Trees of nuclei and bounds on the number of triangulations of S^3
Event details
| Date | 27.11.2015 |
| Hour | 14:15 › 15:30 |
| Speaker | Maher Younan |
| Location |
MA 10
|
| Category | Conferences - Seminars |
In 1962, W. Tutte showed that the number of 2d triangulations (simplicial decompositions) of the sphere S^2 with t triangles grows exponentially with t. The equivalent question in 3d remains open. We introduce a notion of nucleus (a 3d triangulation with boundary such that all nodes are external and each internal face has at most 1 external edge). A nucleus is typically a triangulation with knots along its internal edges.We show that every triangulation can be built from trees of nuclei. This leads to a new reformulation of the above question: We show that if the number of rooted nuclei with t tetrahedra grows exponentially with t, then so does the number of all triangulations of S^3.
Practical information
- Informed public
- Free
Organizer
- Kathryn Hess