Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.

Description

We show that the number of geometric permutations of an arbitrary collection of $n$ pairwise disjoint convex sets in $ eals^d$, for $dgeq 3$, is $O(n^{2d-3}log n)$, improving Wenger's 20 years old bound of $O(n^{2d-2})$.

Questions and Answers

You need to be logged in to be able to post here.