
СЕМИНАРЫ 
Семинар Добрушинской лаборатории Высшей школы современной математики МФТИ



Combinatorial complexity of unions of objects Aronov Boris^{} ^{} New York University 

Аннотация: We will discuss a class of problems that are loosely called “the complexity of unions of objects”. Consider a collection of The content of this talk is loosely based on a 2008 survey “State of the union (of geometric objects)” by Agarwal, Sharir, and Pach, and the speaker"s own involvement in the subject. Motivation, examples, and sketches of the easier proofs will be provided. The discussion will be largely limited to two dimensions due to the speaker's inability to draw anything complicated. 