- Series
- Geometry Topology Student Seminar
- Time
- Wednesday, September 11, 2019 - 2:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Nicholas Barvinok – nbarvinok3@gatech.edu
- Organizer
- Agniva Roy
Cutting a polyhedron along some spanning tree of its edges will yield an isometric immersion of the polyhedron into the plane. If this immersion is also injective, we call it an unfolding. In this talk I will give some general results about unfoldings of polyhedra. There is also a notion of pseudo-edge unfolding, which involves cutting on a pseudo edge graph, as opposed to an edge graph. A pseudo edge graph is a 3-connected graph on the surface of the polyhedron, whose vertices coincide with the vertices of the polyhedron, and whose edges are geodesics. I will explain part of the paper "Pseudo-Edge Unfoldings of Convex Polyhedra," a joint work of mine with Professor Ghomi, which proves the existence of a convex polyhedron with a pseudo edge graph along which it is not unfoldable. Finally, I will discuss some connections between pseudo edge graphs and edge graphs.