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 27, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Sonoko Moriyama (Tohoku University)

Minimal non-orientable matroids of rank three

Minimal non-orientable matroids have been investigated to characterize orientable matroids. The Fano matroid and the MacLane matroid are well-known minimal non-orientable matroids of rank $3$. A natural question is whether there exists a minimal non-orientable matroid of every rank $r$ with $m$ elements. In this talk, we give an answer to the question in rank $3$ that for every $m \geq 7$, there exists a minimal non-orientable matroid of rank $3$ with $m$ elements. To prove this statement, we construct two new infinite families of minimal non-orientable matroids of rank $3$.

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