- Start Date:
December 8, 2021
- Event Start Time:
2:20 PM
- Event End Time:
3:20 PM
- Seminar Series:
Graduate Combinatorics Seminar
- Presenter(s):
Max Aires - Rutgers University
- Event Location:
Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info:
<p><strong>This seminar is being held in person in The Hill Center,<br />
Mathematics Graduate Student Lounge - 7th Floor<br />
and online via a simultaneous broadcast on Zoom. </strong><br />
Zoom Link: <a href="https://rutgers.zoom.us/j/97170484433?pwd=WWR0Vlo5czZ2bW11RGxrZEhyNS9tdz09">https://rutgers.zoom.us/j/97170484433</a></p>
<p>Password: 102958</p>
<p>For further information see: <a href="https://sites.math.rutgers.edu/~ctk47/GCS.html">https://sites.math.rutgers.edu/~ctk47/GCS.html</a></p>
- Presentation Type:
Stand Alone Presentation
- Abstract:
A recurring problem in extremal discrete geometry is to ask for an upper or lower bound on the number of instances of a certain configuration in a set of n points. Important examples of this include the number of lines through k or more points (answered in the famous Szemeredi-Trotter Theorem), and the number of pairs of points at a fixed distance. In this talk, we consider the number of angles with a given measure alpha from n points in the plane, and derive an upper bound of O(n^2 log(n)) from Pach and Sharir. We then show that this bound can be achieved for many values of alpha.
