Polynomial method in combinatorics
 | This article, Polynomial method in combinatorics, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
The polynomial method is an algebraic approach to combinatorics problems that involves capturing some combinatorial structure in the zero-set of a polynomial. Recently, the polynomial method has lead to the development of remarkably simple solutions to long-standing open problems. [1]
References
- ^ Ellenberg, Jordan; Gijswijt, Dion (2017). "On large subsets of \mathbb F_q^n with no three-term arithmetic progression". Annals of Mathematics. 185 (1): 339–343. doi:10.4007/annals.2017.185.1.8. ISSN 0003-486X.