Structure in additively nonsmoothing sets
classification
🧮 math.CO
keywords
setsmanynonsmoothingadditiveadditivelyappearedauthorscite
read the original abstract
Sets with many additive quadruples are guaranteed to have many additive octuples, by H\"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for nonsmoothing sets that originally appeared in work of the authors (\cite{BK}) on the size of cap sets in $F_3 ^N$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.