Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Spheres with $k$ Points Inside

Published 28 Oct 2024 in math.CO and cs.CG | (2410.21204v2)

Abstract: We generalize a classical result by Boris Delaunay that introduced Delaunay triangulations. In particular, we prove that for a locally finite and coarsely dense generic point set $A$ in $\mathbb{R}d$, every generic point of $\mathbb{R}d$ belongs to exactly $\binom{d+k}{d}$ simplices whose vertices belong to $A$ and whose circumspheres enclose exactly $k$ points of $A$. We extend this result to the cases in which the points are weighted, and when $A$ contains only finitely many points in $\mathbb{R}d$ or in $\mathbb{S}d$. Furthermore, we use the result to give a new geometric proof for the fact that volumes of hypersimplices are Eulerian numbers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.