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 J. Lengler, A. Steger, and D. Steurer)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 25, 2025, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: Patrick Schnider

Linear Embeddings of Simplicial Complexes

Given a k-dimensional simplicial complex, can you embed it into d-dimensional Euclidean space? In many cases, the answer depends on the type of embedding you want. In this talk, we focus on linear embeddings, which are less studied than topological or piece-wise linear embeddings. We show that some methods that give obstructions to the existence of a topological embedding can be adapted to the linear setting.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  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