Title | : | Packing, combinatorial Macbeath regions, and semi-algebraic set systems |
Speaker | : | Arijit Ghosh (ISI Kolkata) |
Details | : | Mon, 6 Nov, 2017 3:00 PM @ A M Turing Hall |
Abstract: | : | The packing lemma of Haussler (Journal of Combinatorial Theory, Series A, 1995) states that given a set system with bounded VC dimension, if every pair of sets in the set system has large symmetric difference, then the set system cannot contain too many sets. This has turned out to be the technical foundation for many results in combinatorial geometry and discrepancy. Recently it was generalized by Dutta et al. (Discrete & Computational Geometry, 2016) and Mustafa (Discrete & Computational Geometry, 2016) to the shallow packing lemma, applying to set systems as a function of their shallow-cell complexity. We proved the following new results related to packings:
|