Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, May 15, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Malte Milatz (RWTH Aachen)
Given two knots or links, how may one decide whether they are equivalent? This is a fundamental question in knot theory, known to be decidable, and it reduces to a purely combinatorial question by Reidemeister's theorem.
The general decidability procedure, however, is so complex and unpromising that knot theorists prefer to work on link invariants. Here we have a look at one such invariant, Khovanov homology, which is an example of how to use algebra (homology) for a combinatorial problem.
Computing Khovanov homology of a given link cannot be done efficiently in general. We will discuss methods for its (full or partial) computation in favourable cases, using spectral sequences as a tool.
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