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, February 25, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Anna Gundert

Lattice paths and Lagrangian matroids

We will start with a short introduction to both matroids and Lagrangian matroids, which are a generalization of ordinary matroids. As an example we then consider the Catalan matroid, the set of lattice paths from (0,0) to (2n,0) that stay above the x-axis ("Dyck paths"). Weakening the conditions on this structure, one can consider the set of lattice paths between two fixed paths with a common starting and a common end point, such that one stays above the other. This also yields a matroid.

The class of these matroids ("lattice path matroids", LPMs) can further be generalized by asking for the boundary paths to just have the same length instead of a common end point. This way, one obtains the class of lattice path Lagrangian matroids (LPLMs). Both these classes were studied by A. de Mier and J. Bonin.

If time allows, I will present a result relating LPLMs and LPMs by E.Kim, D. Schymura and A.G.

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