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: Tuesday, March 15, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Istvan Tomon

Hyperplane covers of finite spaces

I will talk about three long-standing conjectures from the intersection of linear algebra and combinatorics that turn out to be closely related: the Alon-Jaeger-Tarsi conjecture (1988) on non-vanishing linear maps, the Additive basis conjecture of Alon-Linial-Meshulem (1991), and a conjecture of Pyber (1996) on coset covers of abelian groups. Recently, we solved the first one in a strong form, the second one in a weak form, and the third one in just the right form. Based on joint works with Janos Nagy and Peter Pal Pach.

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