Algorithm Combinatorics and Optimization Seminar

  • Remote Access Enabled - Zoom
  • Virtual Presentation
  • TING-WEI CHAO
  • Ph.D. Candidate
  • Department of Mathematics Sciences
  • Carnegie Mellon University
Seminars

Point sets in R^d without convex k-holes

Given a point set in Rd in general position, a convex k-hole is a k-element subset in convex position whose convex hull is empty inside. Erdős and Szekeres proved that there always exists a k-element subset in convex position if the size of given point set is large enough. However, for k large enough, it's not guaranteed to be a k-hole. In this talk, I'll talk about the constructions of sets without k-holes.

Zoom Participation. See announcement.

For More Information, Please Contact: 
Keywords: