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, November 08, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Micha Sharir (Tel Aviv University)

Radial isotropic position: Theory, algorithms, and applications

A set X of n vectors on the unit sphere in d dimensions is said to be in isotropic position if the sum of the squares of their projections in any direction is constant, independently of the direction. We say that X can be brought to radial isotropic position if there exists a linear tranformation A, such that if we normalize each of the vectors of AX we get a set in isotropic position.

We review the elegant theory that shows that almost any set X can be brought to radial isotropic position, show the strong connection between this notion and singular value decomposition, a basic tool in linear algebra, present iterative algorithms for approximating the desired linear transformation, and discuss combinatorial and algorithmic applications, most notably the recent work of Kane, Lovett and Moran on point location in high-dimensional hyperplane arrangements.

Joint work with Shiri Artstein-Avidan and Haim Kaplan.

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