We say that a family \(F\) of \(k\)-element sets is a \(j\)-junta if there is a set \(J\) of size \(j\) such that, for any set, its presence in \(F\) depends on its intersection with \(J\) only. Approximating arbitrary families by \(j\)-juntas with small \(j\) is a recent powerful technique in extremal set theory. The weak point of all known approximation by juntas results is that they work in the range \(n > Ck\), where \(C\) is an extremely fast growing function of the input parameters. In this talk, we present a simple and essentially best possible junta approximation result for an important class of families, called shifted. As an application, we present some progress in the question of Aharoni and Howard on families with no cross-matching. Joint work with Peter Frankl.
Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.
The ACO Seminar (2019–2020)