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: Thursday, June 14, 2012, 12:15 pm

Duration: 30 minutes

Location: HG D5.2

Speaker: Francis Sergeraert (Inst. Fourier, Grenoble)

The Eilenberg-Zilber Combinatorial Contraction

Triangulating a product of two simplices Δ^p and Δ^q is not so easy. The Eilenberg-Zilber theorem (1950) establishes the exact homological relation between the brute product and the triangulated product. We will briefly explain how the modern tool "Discrete Vector Fields" gives a much simpler understanding of this essential result, allowing also the programmers to dramatically improve the corresponding algorithms. A machine demo will be included.

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

Previous talks by year:   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