Wenrui is a junior interested in geometry. This summer, he is going to spend more time on cooking and piano besides math research. His favorite composer is J.S. Bach.
Research proposal summary
The research project is on the (p, q)-problem for hypersurfaces. The (p, q)-problem for convex sets is a famous topic in discrete geometry, which studies the minimal number of points (the Hadwiger-Debrunner number) that pierce an arbitrary family of n convex sets in R^d satisfying the (p, q)-property, i.e. every p sets of the family contain q sets with non-empty intersection. Surprisingly, Alon and Kleitman showed that such number is finite and depends on p, q, d only, independent of n, the size of the family of convex sets. Following this, the asymptotic bounds for the Hadwiger-Debrunner number keeps getting improved. We hope to find a similar result when the (p, q)-property is applied to hypersurfaces, which restricts to the roots of polynomials of d variables and degree at most D, and see if the minimal piercing number depends only on p, q, d, D in this case. The hypersurface case seems promising, for Hilbert Nullstellensatz translates the geometric problem of intersection of hypersurfaces into an algebraic one studying the ideal generated by their corresponding polynomials, and this could be handled by algebraic methods similar to those developed for convex sets. If the conjecture is true, we will also adapt the tools for studying convex sets to find asymptotic bounds.