An Improved Bound for k-Sets in Four Dimensions

14 years 9 months ago

Download www.math.tau.ac.il

We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.

Micha Sharir

Real-time Traffic

CPC 2011 | Education | Halving | Simpler |

claim paper

Related Content

» kSets in Four Dimensions

» Improved Delsarte bounds for spherical codes in small dimensions

» Generic Density and Small Span Theorem

» Distance estimation and object location via rings of neighbors

» The Partition Technique for Overlays of Envelopes

» Efficient subset selection based on the Renyi entropy

» Automatic online tuning for fast Gaussian summation

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CPC
Authors	Micha Sharir

Comments (0)

Sciweavers

An Improved Bound for k-Sets in Four Dimensions

CPC 2011 | Education | Halving | Simpler |

Explore & Download

Productivity Tools

Sciweavers