Grigory Kabatiansky "Cover-free families of sets, their generalizations and applications"
Grigory Kabatiansky from Skoltech will give the talk "Cover-free families of sets, their generalizations and applications' Big Seminar.
Password: first 6 decimal places of $\pi$
You can also write to Alexander Polyanskii (email@example.com) or to Maksim Zhukovskii (firstname.lastname@example.org) if you want to be added to mailing list.
We start from the following question:
What is the maximal number of subsets of a given finite set such that no one subset is covered by t others?
We present the history of this problem which was discovered under different names in group testing, coding theory and combinatorics. We consider variations of the problem, in particular, Renyi-Ulam search with a lie. Then we embed the problem into more general question:
How to find unknown subset of a finite set?
Watch the video:
Everyone is invited to attend. The language of the lecture is English. The event is aimed at master and graduate students, as well as researchers in the field of combinatorics.