On weighted sums of numbers of convex polygons in point sets

DOI10.1007/S00454-022-00395-8MaRDI QIDQ2167313zbMATH OpenOpenAlexFDO

Authors Clemens Huemer, P. Pérez-Lantero, Ferran Torra, Birgit Vogtenhuber, Deborah Oliveros

Publication date 25 August 2022

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1910.08736

zbMATH Keywords

empty convex polygonsErdős-Szekeres type problemsplanar point sets

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $ell$ points of $S$ in their interior. We prove several equalities for the numbers $X_{k,ell}(S)$. This problem is related to the ErdH{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.

Recommendations

• Counting convex polygons in planar point sets
• On triangulations of the convex hull of n points
• Counting convex \(k\)-gons in planar point sets
• On \(k\)-convex point sets
• A Weighted Erdoes-Mordell Inequality for Polygons
• On some weighted Erdős-Mordell's type inequalities for polygons
• On sumsets and convex hull
• On k-convex polygons
• scientific article; zbMATH DE number 7397945
• scientific article; zbMATH DE number 7478593

Cites work

• A Generalization of Radon's Theorem
• A note on the number of empty triangles
• A superlinear lower bound on the number of 5-holes
• An Euler relation for valuations on polytopes
• Combinatorial sums and finite differences
• Computing optimal islands
• Convexity and the beta invariant
• Counting the interior points of a point configuration
• Crossing Number Problems
• Empty convex hexagons in planar point sets
• Finding sets of points without empty convex 6-gons
• scientific article; zbMATH DE number 3168302 (Why is no real title available?)
• scientific article; zbMATH DE number 3895765 (Why is no real title available?)
• scientific article; zbMATH DE number 1862742 (Why is no real title available?)
• Konvexe Fünfecke in ebenen Punktmengen
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• On empty convex polygons in a planar point set
• On the Erdős-Szekeres convex polygon problem
• Planar point sets with a small number of empty convex polygons
• Point sets with small integer coordinates and no large convex polygons
• Sets with No Empty Convex 7-Gons
• Some notes on the Erdős-Szekeres theorem
• The empty hexagon theorem
• The Erdos-Szekeres problem on points in convex position – a survey
• The theory of convex geometries

Cited in

(4)

• scientific article; zbMATH DE number 7397945 (Why is no real title available?)
• scientific article; zbMATH DE number 2068096 (Why is no real title available?)
• scientific article; zbMATH DE number 7478593 (Why is no real title available?)
• Combinatorial complexity of convex sequences

This page was built for publication: On weighted sums of numbers of convex polygons in point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167313)