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 30, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Emo Welzl

Triangulations of Convex Polygons - A Historical Note

Around 1750 Euler asked for the number of triangulations of a convex n-gon (in a letter to Goldbach), but it took about eighty years until this question was resolved with the answer we know it today (Catalan numbers). This will be mostly historical remarks (fresh up your Latin!), including the one-picture proof that Euler missed, although he already conjectured the solution based on the first entries of the sequence.


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