Abstract

An arc is a set of points in  which does not contain any collinear triples. This talk will discuss how the method of hypergraph containers can be used to prove various counting results concerning the number of arcs in . For instance, I will discuss a recent result which shows that there are  arcs in . This bound is optimal up to the o(1) factor, as can be seen by considering any arc of size q and all of its subsets. The talk is based on joint work with Audie Warren and Krishnendu Bhowmick.

Link information:　https://gapowork.vn/meet/CnC-AvSYDMk1-HaUNZ