Seminar Details
Anticoncentration via the Strong Perfect Graph Theorem
- Start Date: March 25, 2024
- Event Start Time: 2:00 PM
- Event End Time: 3:00 PM
- Seminar Series: Rutgers Discrete Mathematics Seminar
- Presenter(s): Tomas JuÅ¡keviÄius - Vilnius University
- Event Location: Conference Room 705 | Rutgers University | Hill Center | 110 Frelinghuysen Rd
- Event Additional Info: <p>See: <a href="https://sites.google.com/view/rutgersdmseminar">https://sites.google.com/view/rutgersdmseminar</a></p>
- Presentation Type: Stand Alone Presentation
- Abstract:
In this talk we shall address anticoncentration inequalities for sums of random vectors. In particular, we shall discuss how to asymptotically establish two conjectures: one by Lee Jones (1978) and another by Leader-Radcliffe (1994). Perhaps surprisingly, the main ingredient to establish the latter result is the strong perfect graph theorem by Chudnovsky, Robertson, Seymour and Thomas (2002). Most of the talk will be centered not so much on the proofs, but more on how two seemingly different branches of mathematics can be linked in a useful way (Probability and Structural Graph Theory).
The talk is based on joint work with V. Kurauskas (Vilnius University, Lithuania).
