On weighted sums of numbers of convex polygons in point sets
Clemens Huemer, Deborah Oliveros, Pablo P\'erez-Lantero, Ferran Torra,, Birgit Vogtenhuber

TL;DR
This paper derives new equalities relating to the counts of convex polygons with specific interior points in point sets, extending classical results and exploring higher-dimensional analogs.
Contribution
It introduces novel equalities for convex polygons with interior points, extending existing equations and applying to higher dimensions.
Findings
Derived new equalities for convex polygons with interior points
Extended known equations for empty convex polygons
Presented results for higher-dimensional point sets
Abstract
Let be a set of points in general position in the plane, and let be the number of convex -gons with vertices in that have exactly points of in their interior. We prove several equalities for the numbers . This problem is related to the Erd\H{o}s-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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Facility Location and Emergency Management
