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, March 21, 2019, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Mihyun Kang (TU Graz)
We consider d-dimensional random simplicial complexes that are generated from the binomial random (d+1)-uniform hypergraph by taking the downward-closure. For each integer j between one and (d-1), we determine when all cohomology groups with coefficients in the two-element field F from dimension one up to j vanish and the zero-th cohomology group is isomorphic to F. This property is not deterministically monotone, but we show that it has a single sharp threshold. This is joint work with Oliver Cooley, Nicola Del Giudice, and Philipp Spruessel.
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