2010/09/12 by Amol Aggarwal, Aggarwal, Amol
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Point processes and geometric inequalities #cs.CG #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1009.2218
openalex publication_date 2010/09/12 · arxiv created 2010/09/15 · arxiv updated 2010/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given any convex n-gon, in this article, we: (i) prove that its vertices can form at most n2/2 + Θ(nlog n) isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most 3n2/4 + o(n2) isosceles triangles and prove this conjecture for a special group of convex n-gons, (iii) prove that its vertices can form at most \lfloor n/k \rfloor regular k-gons for any integer k≥ 4 and that this bound is optimal, and (iv) provide a short proof that the sum of all the distances between its vertices is at least (n-1)/2 and at most \lfloor n/2 \rfloor \lceil n/2 \rceil(1/2) as long as the convex n-gon has unit perimeter.