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, October 18, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Felix Dräxler

Spherical Codes in Euclidean Space

A set of unit vectors in Euclidean space is called a spherical L-code if the inner product of every pair of unit vectors lies in L. If L consists of an interval of the form [-1,-b] together with a single positive value a, how large can a spherical L-code be in n dimensions? We will discuss the history of the problem and prove that there can be no more than 2(1+a/b)n + o(n) many vectors in such a set.

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