Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, September 28, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room and maybe CAB G51

Speaker: Valentin Stoppiello

Edge sets of three dimensional triangulations

In my master thesis, we look at triangulations and subdivisions in three dimensions from different perspectives, to learn more about the structure of the space of triangulations. The main topic of the talk is about representing three-dimensional triangulations as Boolean strings. This representation follows from the observation that triangulations in three dimensions are uniquely characterised by their edge sets. We prove that when giving the flip graph a suitable orientation, it is an induced subgraph of the Boolean lattice. Additionally, we calculate an upper bound for the maximal length of directed paths in this subgraph, and show that it is tight.

These results are from my master thesis "Triangulations and Subdivisions in three dimensions", supervised by Emo Welzl, Patrick Schnider and Nicolas Grelier.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login