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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 07, 2016, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Igor Balla

Equiangular Lines

A set of lines is said to be equiangular if every pair of lines make the same angle. In d dimensions, many such lines can we have? We will discuss the history of this question and prove that for any fixed angle and d large enough, the number of lines we can have is at most (2 + o(1)) d.

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

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