Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Upper bounds for sunflower-free sets
Eric Naslund,
Will Sawin
Research output
:
Contribution to journal
›
Article
›
peer-review
36
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Upper bounds for sunflower-free sets'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Upper Bound
100%
Polynomials Method
100%
Polynomial
50%
Arithmetic Progression
50%
Matrix Multiplication
50%
Intersection Theorem
50%
Keyphrases
Progression-free Sets
11%