Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, October 26, 2010, 12:15 pm

**Duration**: This information is not available in the database

**Location**: OAT S15/S16/S17

**Speaker**: Frederik von Heymann (TU Delft)

Consider a point p on the n-dimensional sphere. We can find 2^n sums by summing up the coordinates of p, where we are allowed to change the sign of every entry. Is it possible to choose p (and n) such that more than half of the sums have absolute value >1?

This question, first published in 1986, is still open and has nice interpretations in combinatorics, geometry, probability theory and other branches of mathematics. We will use the probabilistic reformulation to show that at least (3/8)th of the sums have absolute value at most 1, and the geometric reformulation to solve the problem for small dimensions.

Main source: Ron Holzman, Daniel Kleitman: On the product of sign vectors and unit vectors, Combinatorica 12 (1992).

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