Some old and new problems in combinatorics and geometry

14 Jul

Originally posted on Combinatorics and more:

Paul99

Paul Erdős in Jerusalem, 1933  1993

I just came back from a great Erdős Centennial conference in wonderful Budapest. I gave a lecture on old and new problems (mainly) in combinatorics and geometry (here are the slides), where I presented twenty problems, here they are:

Around Borsuk’s Problem

Let $latex f(d)$ be the smallest integer so that every set of diameter one in $latex R^d$ can be covered by $latex f(d)$ sets of smaller diameter. Borsuk conjectured that $latex f(d) \le d+1$.

It is known (Kahn and Kalai, 1993) that : $latex f(d) \ge 1.2^{\sqrt d}$, and also that (Schramm, 1989) $latex f(d) \le (\sqrt{3/2}+o(1))^d$.

Problem 1: Is f(d) exponential in d?

Problem 2: What is the smallest dimension for which Borsuk’s conjecture is false?

Volume of sets of constant width in high dimensions

Problem 3: Let us denote the volume of the n-ball of radius 1/2 by $latex…

View original 1,499 more words

About these ads

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

%d bloggers like this: