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, July 12, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Florian Block

Tropical Convexity via Cellular Rsolutions

Tropical polytopes were introduced by Develin and Sturmfels in 2004 and live in the geometry over the tropical semiring (R,min,+). Their cellular structures support minimal free resolutions of some monomial ideals. Therefore, we can use methods from computational commutative algebra to compute tropical polytopes. We will introduce the above objects, explain an algorithm that computes tropical polytopes, and give examples. If time allows, we will have a closer look at tropical cyclic polytopes, a beautiful analog of ordinary cyclic polytopes.

(Joint work with Josephine Yu)

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