On weighted sums of numbers of convex polygons in point sets
Abstract
Let S be a set of n points in general position in the plane, and let Xk,(S) be the number of convex k-gons with vertices in S that have exactly points of S in their interior. We prove several equalities for the numbers Xk,(S). This problem is related to the Erdos-Szekeres theorem. Some of the obtained equations also extend known equations for the numbers of empty convex polygons to polygons with interior points. Analogous results for higher dimension are shown as well.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.