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, October 19, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Igor Balla

Equiangular Subspaces

A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in Euclidean space was studied extensively for the last 70 years. In this talk, we consider analogous questions for k-dimensional subspaces. We discuss natural ways of defining the angle between k-dimensional subspaces and correspondingly study the maximum size of an equiangular set of k-dimensional subspaces in R^d. Our bounds extend and improve a result of Blokhuis.

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