Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Friday, May 04, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Carsten Lange (Freie Universität Berlin)
Some partitions of the symmetric group combine nice combinatorial and geometric properties: each equivalence class consists of the linear extensions of a poset and there is a convex polytope that encodes this information. This has been studied by Morton, Pachter, Shiu, Sturmfels and Wienand in the context of convex rank texts. In this talk, we focus on a special class of polytopes of this type called associahedra. We give first results how relevant information on the partition of the symmetric group can be recovered from the polytope.
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